./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 134aac8861f2c5bf04212e2f21cf253e9f2237d8b16bed0dc3f4961f50ff1980 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:06:10,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:06:10,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 23:06:10,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:06:10,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:06:10,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:06:10,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:06:10,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:06:10,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:06:10,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:06:10,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:06:10,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:06:10,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:06:10,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:06:10,549 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:06:10,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:06:10,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:06:10,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 23:06:10,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:06:10,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:06:10,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:06:10,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:06:10,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:06:10,553 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:06:10,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:06:10,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:06:10,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:06:10,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:06:10,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:06:10,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:06:10,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:06:10,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:06:10,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:06:10,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:06:10,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:06:10,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 23:06:10,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 23:06:10,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:06:10,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:06:10,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:06:10,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:06:10,558 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134aac8861f2c5bf04212e2f21cf253e9f2237d8b16bed0dc3f4961f50ff1980 [2024-10-14 23:06:10,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:06:10,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:06:10,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:06:10,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:06:10,821 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:06:10,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:12,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:06:12,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:06:12,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:12,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535adcf72/2caab901fbd94399a4aa74edbcc5da3a/FLAGb2d2e5a86 [2024-10-14 23:06:12,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535adcf72/2caab901fbd94399a4aa74edbcc5da3a [2024-10-14 23:06:12,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:06:12,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:06:12,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:06:12,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:06:12,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:06:12,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:12" (1/1) ... [2024-10-14 23:06:12,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e64209c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:12, skipping insertion in model container [2024-10-14 23:06:12,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:12" (1/1) ... [2024-10-14 23:06:12,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:06:13,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:06:13,531 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:06:13,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:06:13,727 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:06:13,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13 WrapperNode [2024-10-14 23:06:13,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:06:13,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:06:13,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:06:13,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:06:13,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,808 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 65 [2024-10-14 23:06:13,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:06:13,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:06:13,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:06:13,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:06:13,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,847 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 23:06:13,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:06:13,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:06:13,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:06:13,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:06:13,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (1/1) ... [2024-10-14 23:06:13,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:06:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:06:13,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 23:06:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 23:06:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 23:06:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 23:06:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 23:06:13,948 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 23:06:13,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:06:13,949 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-14 23:06:13,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-14 23:06:13,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:06:13,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:06:14,071 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:06:14,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:06:14,224 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 23:06:14,224 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:06:14,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:06:14,250 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 23:06:14,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:14 BoogieIcfgContainer [2024-10-14 23:06:14,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:06:14,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:06:14,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:06:14,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:06:14,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:06:12" (1/3) ... [2024-10-14 23:06:14,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d03adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:14, skipping insertion in model container [2024-10-14 23:06:14,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:13" (2/3) ... [2024-10-14 23:06:14,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d03adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:14, skipping insertion in model container [2024-10-14 23:06:14,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:14" (3/3) ... [2024-10-14 23:06:14,258 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:14,275 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:06:14,275 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 23:06:14,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:06:14,358 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cd5bae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:06:14,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 23:06:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 23:06:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 23:06:14,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:14,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:14,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-14 23:06:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048677499] [2024-10-14 23:06:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:14,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048677499] [2024-10-14 23:06:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048677499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:06:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55116507] [2024-10-14 23:06:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:06:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:06:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:06:14,772 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:14,896 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-14 23:06:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 23:06:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 23:06:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:14,907 INFO L225 Difference]: With dead ends: 56 [2024-10-14 23:06:14,907 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 23:06:14,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:06:14,915 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:14,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 162 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 23:06:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 23:06:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-14 23:06:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 23:06:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-14 23:06:14,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2024-10-14 23:06:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-14 23:06:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-14 23:06:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 23:06:14,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:14,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 23:06:14,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1916119026, now seen corresponding path program 1 times [2024-10-14 23:06:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616978818] [2024-10-14 23:06:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616978818] [2024-10-14 23:06:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616978818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:15,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:06:15,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063380941] [2024-10-14 23:06:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:15,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:06:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:06:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:06:15,129 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:15,202 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-14 23:06:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 23:06:15,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 23:06:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:15,205 INFO L225 Difference]: With dead ends: 42 [2024-10-14 23:06:15,205 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 23:06:15,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:06:15,207 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:15,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 128 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 23:06:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-14 23:06:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 23:06:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-14 23:06:15,218 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-14 23:06:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-14 23:06:15,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-14 23:06:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 23:06:15,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:15,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:15,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 23:06:15,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-14 23:06:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210543597] [2024-10-14 23:06:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210543597] [2024-10-14 23:06:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210543597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:06:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132668673] [2024-10-14 23:06:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:15,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:06:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:06:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:06:15,291 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:15,313 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-14 23:06:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:06:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 23:06:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:15,316 INFO L225 Difference]: With dead ends: 39 [2024-10-14 23:06:15,317 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 23:06:15,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:06:15,318 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:15,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 23:06:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 23:06:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 23:06:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-14 23:06:15,328 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 12 [2024-10-14 23:06:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:15,329 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-14 23:06:15,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-14 23:06:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 23:06:15,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:15,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 23:06:15,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:15,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 729330087, now seen corresponding path program 1 times [2024-10-14 23:06:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974163422] [2024-10-14 23:06:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974163422] [2024-10-14 23:06:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974163422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:06:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037316641] [2024-10-14 23:06:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:06:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:15,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:06:15,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:15,442 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:15,463 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-14 23:06:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:06:15,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 23:06:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:15,465 INFO L225 Difference]: With dead ends: 58 [2024-10-14 23:06:15,465 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 23:06:15,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:15,467 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:15,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 23:06:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 23:06:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 23:06:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-10-14 23:06:15,472 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2024-10-14 23:06:15,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:15,472 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-10-14 23:06:15,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-10-14 23:06:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 23:06:15,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:15,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:15,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 23:06:15,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:15,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-14 23:06:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618211660] [2024-10-14 23:06:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:06:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 23:06:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618211660] [2024-10-14 23:06:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618211660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:15,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:06:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980227793] [2024-10-14 23:06:15,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:06:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:06:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:15,582 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:15,601 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-10-14 23:06:15,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:06:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-14 23:06:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:15,603 INFO L225 Difference]: With dead ends: 30 [2024-10-14 23:06:15,603 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 23:06:15,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:15,605 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:15,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 23:06:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 23:06:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 23:06:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-14 23:06:15,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2024-10-14 23:06:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:15,617 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-14 23:06:15,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-14 23:06:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 23:06:15,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:15,620 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 23:06:15,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2061737047, now seen corresponding path program 1 times [2024-10-14 23:06:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:06:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926608882] [2024-10-14 23:06:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:06:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:06:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 23:06:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 23:06:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:06:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926608882] [2024-10-14 23:06:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926608882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:06:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888351240] [2024-10-14 23:06:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:06:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:06:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:06:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:06:15,726 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:15,772 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-14 23:06:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 23:06:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-14 23:06:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:15,772 INFO L225 Difference]: With dead ends: 26 [2024-10-14 23:06:15,773 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 23:06:15,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:06:15,774 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:15,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 23:06:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 23:06:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:06:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 23:06:15,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-14 23:06:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:15,775 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 23:06:15,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 23:06:15,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 23:06:15,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 23:06:15,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 23:06:15,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 23:06:15,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 23:06:15,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 23:06:15,782 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 23:06:15,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 23:06:15,948 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 23:06:15,971 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:15,977 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-14 23:06:15,977 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:15,977 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-14 23:06:15,978 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-14 23:06:15,979 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:15,979 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-14 23:06:15,979 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:15,980 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-14 23:06:15,980 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-14 23:06:15,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:06:15 BoogieIcfgContainer [2024-10-14 23:06:15,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 23:06:15,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 23:06:15,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 23:06:15,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 23:06:15,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:14" (3/4) ... [2024-10-14 23:06:15,984 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 23:06:15,988 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 23:06:15,988 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 23:06:15,988 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-14 23:06:15,992 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-14 23:06:15,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 23:06:15,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 23:06:16,032 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-14 23:06:16,036 INFO L158 Benchmark]: Toolchain (without parser) took 3269.80ms. Allocated memory is still 151.0MB. Free memory was 80.7MB in the beginning and 52.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,036 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:06:16,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 959.31ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 63.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.96ms. Allocated memory is still 151.0MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,036 INFO L158 Benchmark]: Boogie Preprocessor took 63.89ms. Allocated memory is still 151.0MB. Free memory was 60.1MB in the beginning and 58.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:06:16,037 INFO L158 Benchmark]: RCFGBuilder took 375.86ms. Allocated memory is still 151.0MB. Free memory was 58.0MB in the beginning and 114.9MB in the end (delta: -56.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,037 INFO L158 Benchmark]: TraceAbstraction took 1729.10ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 56.0MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,037 INFO L158 Benchmark]: Witness Printer took 53.55ms. Allocated memory is still 151.0MB. Free memory was 56.0MB in the beginning and 52.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:06:16,038 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 959.31ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 63.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.96ms. Allocated memory is still 151.0MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.89ms. Allocated memory is still 151.0MB. Free memory was 60.1MB in the beginning and 58.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 375.86ms. Allocated memory is still 151.0MB. Free memory was 58.0MB in the beginning and 114.9MB in the end (delta: -56.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1729.10ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 56.0MB in the end (delta: 57.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 53.55ms. Allocated memory is still 151.0MB. Free memory was 56.0MB in the beginning and 52.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 153 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=1, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~int~TO~VOID Derived contract for procedure ##fun~int~TO~VOID. Requires: ((((long) 2 + \old()) == 0) || (\old() <= 2147483647)) Ensures: ((((long) 2 + \old()) == 0) || (\old() <= 2147483647)) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-14 23:06:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 134aac8861f2c5bf04212e2f21cf253e9f2237d8b16bed0dc3f4961f50ff1980 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:06:18,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:06:18,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-14 23:06:18,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:06:18,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:06:18,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-14 23:06:18,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:06:18,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:06:18,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:06:18,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:06:18,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:06:18,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:06:18,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:06:18,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:06:18,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:06:18,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:06:18,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:06:18,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:06:18,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:06:18,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:06:18,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:06:18,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:06:18,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 23:06:18,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 23:06:18,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:06:18,417 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:06:18,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 23:06:18,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:06:18,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:06:18,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:06:18,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:06:18,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:06:18,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:06:18,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:06:18,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:06:18,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:06:18,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:06:18,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:06:18,427 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 23:06:18,427 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 23:06:18,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:06:18,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:06:18,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:06:18,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:06:18,429 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 23:06:18,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 134aac8861f2c5bf04212e2f21cf253e9f2237d8b16bed0dc3f4961f50ff1980 [2024-10-14 23:06:18,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:06:18,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:06:18,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:06:18,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:06:18,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:06:18,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:20,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:06:20,511 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:06:20,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:20,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b65c5fee/49f0bb1814d44cb5820d8d0c441aa69e/FLAGf021c41ab [2024-10-14 23:06:20,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b65c5fee/49f0bb1814d44cb5820d8d0c441aa69e [2024-10-14 23:06:20,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:06:20,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:06:20,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:06:20,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:06:20,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:06:20,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:20" (1/1) ... [2024-10-14 23:06:20,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42138a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:20, skipping insertion in model container [2024-10-14 23:06:20,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:06:20" (1/1) ... [2024-10-14 23:06:20,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:06:21,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:06:21,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:06:21,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:06:21,679 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:06:21,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21 WrapperNode [2024-10-14 23:06:21,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:06:21,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:06:21,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:06:21,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:06:21,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,742 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 64 [2024-10-14 23:06:21,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:06:21,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:06:21,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:06:21,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:06:21,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,783 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 23:06:21,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:06:21,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:06:21,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:06:21,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:06:21,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (1/1) ... [2024-10-14 23:06:21,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:06:21,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:06:21,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 23:06:21,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 23:06:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 23:06:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 23:06:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 23:06:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 23:06:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:06:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-14 23:06:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-14 23:06:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:06:21,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:06:22,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:06:22,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:06:22,242 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-14 23:06:22,242 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:06:22,284 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:06:22,284 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 23:06:22,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:22 BoogieIcfgContainer [2024-10-14 23:06:22,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:06:22,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:06:22,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:06:22,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:06:22,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:06:20" (1/3) ... [2024-10-14 23:06:22,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e5f917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:22, skipping insertion in model container [2024-10-14 23:06:22,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:06:21" (2/3) ... [2024-10-14 23:06:22,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e5f917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:06:22, skipping insertion in model container [2024-10-14 23:06:22,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:22" (3/3) ... [2024-10-14 23:06:22,294 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_sub_44_good.i [2024-10-14 23:06:22,310 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:06:22,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 23:06:22,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:06:22,373 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59ee0b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:06:22,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 23:06:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 23:06:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 23:06:22,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:22,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:22,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:22,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-14 23:06:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 23:06:22,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207350818] [2024-10-14 23:06:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 23:06:22,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 23:06:22,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 23:06:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:22,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 23:06:22,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:06:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:22,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:06:22,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 23:06:22,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207350818] [2024-10-14 23:06:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207350818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:22,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 23:06:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625093245] [2024-10-14 23:06:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 23:06:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 23:06:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 23:06:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 23:06:22,664 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:22,776 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-10-14 23:06:22,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 23:06:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 23:06:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:22,785 INFO L225 Difference]: With dead ends: 54 [2024-10-14 23:06:22,785 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 23:06:22,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 23:06:22,791 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:22,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 23:06:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 23:06:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-14 23:06:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 23:06:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-14 23:06:22,829 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2024-10-14 23:06:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-14 23:06:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-14 23:06:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 23:06:22,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:22,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:22,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 23:06:23,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:23,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-14 23:06:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 23:06:23,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703986138] [2024-10-14 23:06:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 23:06:23,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 23:06:23,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 23:06:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:23,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 23:06:23,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:06:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:23,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:06:23,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 23:06:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703986138] [2024-10-14 23:06:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703986138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:23,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:06:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315459921] [2024-10-14 23:06:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:06:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 23:06:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:06:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:23,168 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:23,213 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-14 23:06:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:06:23,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-14 23:06:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:23,215 INFO L225 Difference]: With dead ends: 52 [2024-10-14 23:06:23,215 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 23:06:23,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:23,218 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:23,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 23:06:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 23:06:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 23:06:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-14 23:06:23,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 12 [2024-10-14 23:06:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-14 23:06:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:06:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-14 23:06:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 23:06:23,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:23,239 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:23,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 23:06:23,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-14 23:06:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 23:06:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125411955] [2024-10-14 23:06:23,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:23,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 23:06:23,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 23:06:23,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 23:06:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:23,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 23:06:23,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:06:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 23:06:23,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:06:23,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 23:06:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125411955] [2024-10-14 23:06:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125411955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 23:06:23,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988825406] [2024-10-14 23:06:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:23,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 23:06:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 23:06:23,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 23:06:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:23,594 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:23,636 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-14 23:06:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 23:06:23,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-14 23:06:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:23,638 INFO L225 Difference]: With dead ends: 27 [2024-10-14 23:06:23,639 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 23:06:23,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 23:06:23,641 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:23,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 23:06:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 23:06:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 23:06:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-10-14 23:06:23,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2024-10-14 23:06:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:23,662 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-10-14 23:06:23,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-10-14 23:06:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 23:06:23,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:06:23,667 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:06:23,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 23:06:23,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 23:06:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:06:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 620696973, now seen corresponding path program 1 times [2024-10-14 23:06:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 23:06:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837802587] [2024-10-14 23:06:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:06:23,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 23:06:23,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 23:06:23,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 23:06:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:06:23,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 23:06:23,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 23:06:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 23:06:23,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 23:06:23,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 23:06:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837802587] [2024-10-14 23:06:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837802587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:06:23,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:06:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:06:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262106533] [2024-10-14 23:06:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:06:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:06:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 23:06:23,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:06:23,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:06:23,955 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:06:23,976 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-10-14 23:06:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:06:23,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-14 23:06:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:06:23,979 INFO L225 Difference]: With dead ends: 25 [2024-10-14 23:06:23,979 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 23:06:23,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:06:23,980 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:06:23,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:06:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 23:06:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 23:06:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 23:06:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 23:06:23,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-14 23:06:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:06:23,984 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 23:06:23,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 23:06:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 23:06:23,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 23:06:23,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 23:06:23,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 23:06:23,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 23:06:23,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 23:06:23,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 23:06:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 23:06:24,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 23:06:24,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 23:06:24,325 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 23:06:24,356 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:24,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset [2024-10-14 23:06:24,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:24,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-14 23:06:24,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-14 23:06:24,361 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-14 23:06:24,362 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-14 23:06:24,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:06:24 BoogieIcfgContainer [2024-10-14 23:06:24,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 23:06:24,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 23:06:24,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 23:06:24,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 23:06:24,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:06:22" (3/4) ... [2024-10-14 23:06:24,367 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 23:06:24,370 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 23:06:24,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 23:06:24,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-14 23:06:24,377 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-14 23:06:24,377 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 23:06:24,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 23:06:24,378 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 23:06:24,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 23:06:24,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 23:06:24,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 23:06:24,477 INFO L158 Benchmark]: Toolchain (without parser) took 3920.76ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 33.2MB in the beginning and 41.4MB in the end (delta: -8.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,477 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 46.1MB. Free memory is still 22.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:06:24,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1121.76ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.7MB in the end (delta: -5.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 75.5MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,478 INFO L158 Benchmark]: Boogie Preprocessor took 71.49ms. Allocated memory is still 75.5MB. Free memory was 35.8MB in the beginning and 32.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,478 INFO L158 Benchmark]: RCFGBuilder took 466.25ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 39.0MB in the end (delta: -6.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,478 INFO L158 Benchmark]: TraceAbstraction took 2075.32ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 38.1MB in the beginning and 46.2MB in the end (delta: -8.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,479 INFO L158 Benchmark]: Witness Printer took 113.30ms. Allocated memory is still 94.4MB. Free memory was 46.2MB in the beginning and 41.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 23:06:24,483 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 46.1MB. Free memory is still 22.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1121.76ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.7MB in the end (delta: -5.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 75.5MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.49ms. Allocated memory is still 75.5MB. Free memory was 35.8MB in the beginning and 32.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.25ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 39.0MB in the end (delta: -6.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2075.32ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 38.1MB in the beginning and 46.2MB in the end (delta: -8.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 113.30ms. Allocated memory is still 94.4MB. Free memory was 46.2MB in the beginning and 41.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1567]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 90 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 2 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 23:06:24,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE