./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/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d 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/CWE190_Integer_Overflow__int_fscanf_postinc_12_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 a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:56:03,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:56:04,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:56:04,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:56:04,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:56:04,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:56:04,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:56:04,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:56:04,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:56:04,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:56:04,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:56:04,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:56:04,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:56:04,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:56:04,114 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:56:04,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:56:04,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:56:04,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:56:04,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:56:04,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:56:04,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:56:04,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:56:04,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:56:04,118 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:56:04,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:56:04,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:56:04,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:56:04,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:56:04,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:56:04,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:56:04,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:56:04,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:04,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:56:04,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:56:04,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:56:04,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:56:04,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:56:04,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:56:04,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:56:04,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:56:04,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:56:04,124 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 -> a888b919d012babd5ba30e3ca20e72df0dea0bc5e498f464f6a948a8ccca3b4b [2024-10-13 14:56:04,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:56:04,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:56:04,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:56:04,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:56:04,407 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:56:04,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-13 14:56:05,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:56:06,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:56:06,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-13 14:56:06,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d686b75c3/3628e43149cf4bb9a427355adf3361ac/FLAG7140ca325 [2024-10-13 14:56:06,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d686b75c3/3628e43149cf4bb9a427355adf3361ac [2024-10-13 14:56:06,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:56:06,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:56:06,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:06,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:56:06,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:56:06,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:06" (1/1) ... [2024-10-13 14:56:06,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef51150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:06, skipping insertion in model container [2024-10-13 14:56:06,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:06" (1/1) ... [2024-10-13 14:56:06,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:56:07,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:07,165 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:56:07,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:07,419 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:56:07,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07 WrapperNode [2024-10-13 14:56:07,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:07,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:07,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:56:07,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:56:07,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,491 INFO L138 Inliner]: procedures = 499, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2024-10-13 14:56:07,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:07,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:56:07,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:56:07,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:56:07,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,517 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:56:07,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:56:07,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:56:07,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:56:07,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:56:07,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (1/1) ... [2024-10-13 14:56:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:56:07,566 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-13 14:56:07,570 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-13 14:56:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 14:56:07,604 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 14:56:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-10-13 14:56:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-10-13 14:56:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:56:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:56:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:56:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:56:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:56:07,742 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:56:07,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:56:07,907 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-13 14:56:07,907 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:56:07,944 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:56:07,945 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 14:56:07,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:07 BoogieIcfgContainer [2024-10-13 14:56:07,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:56:07,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:56:07,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:56:07,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:56:07,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:56:06" (1/3) ... [2024-10-13 14:56:07,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa1e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:07, skipping insertion in model container [2024-10-13 14:56:07,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:07" (2/3) ... [2024-10-13 14:56:07,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa1e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:07, skipping insertion in model container [2024-10-13 14:56:07,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:07" (3/3) ... [2024-10-13 14:56:07,955 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_12_good.i [2024-10-13 14:56:07,971 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:56:07,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 14:56:08,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:56:08,048 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;@7fe916eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:56:08,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 14:56:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 42 states have internal predecessors, (49), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 14:56:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 14:56:08,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:08,064 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:08,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:08,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash -436570351, now seen corresponding path program 1 times [2024-10-13 14:56:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309439308] [2024-10-13 14:56:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,478 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-13 14:56:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309439308] [2024-10-13 14:56:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309439308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:08,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037052196] [2024-10-13 14:56:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:08,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:08,514 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 42 states have internal predecessors, (49), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 14:56:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:08,601 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-10-13 14:56:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:08,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-13 14:56:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:08,612 INFO L225 Difference]: With dead ends: 58 [2024-10-13 14:56:08,612 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 14:56:08,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-13 14:56:08,619 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:08,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 14:56:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 14:56:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 14:56:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.4) internal successors, (42), 36 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-10-13 14:56:08,663 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 19 [2024-10-13 14:56:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-10-13 14:56:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 14:56:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-10-13 14:56:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 14:56:08,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:08,669 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:08,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:56:08,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -436554463, now seen corresponding path program 1 times [2024-10-13 14:56:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273998707] [2024-10-13 14:56:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,853 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-13 14:56:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273998707] [2024-10-13 14:56:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273998707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082536581] [2024-10-13 14:56:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:08,858 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 14:56:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:08,904 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-13 14:56:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-13 14:56:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:08,908 INFO L225 Difference]: With dead ends: 49 [2024-10-13 14:56:08,908 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 14:56:08,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-13 14:56:08,910 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:08,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 14:56:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 14:56:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-13 14:56:08,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 19 [2024-10-13 14:56:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:08,923 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-13 14:56:08,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 14:56:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-10-13 14:56:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 14:56:08,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:08,924 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 14:56:08,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash -648778927, now seen corresponding path program 1 times [2024-10-13 14:56:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592019760] [2024-10-13 14:56:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:08,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,018 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-13 14:56:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592019760] [2024-10-13 14:56:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592019760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:56:09,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760647711] [2024-10-13 14:56:09,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:09,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:09,022 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:56:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:09,048 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-13 14:56:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-13 14:56:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:09,051 INFO L225 Difference]: With dead ends: 48 [2024-10-13 14:56:09,051 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 14:56:09,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 14:56:09,053 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:09,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 14:56:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-13 14:56:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-13 14:56:09,065 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 20 [2024-10-13 14:56:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-13 14:56:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:56:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-13 14:56:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 14:56:09,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:09,067 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:09,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:56:09,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:09,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -648286383, now seen corresponding path program 1 times [2024-10-13 14:56:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:09,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017380808] [2024-10-13 14:56:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,160 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-13 14:56:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017380808] [2024-10-13 14:56:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017380808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:09,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 14:56:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118310140] [2024-10-13 14:56:09,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:09,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 14:56:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:09,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 14:56:09,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 14:56:09,164 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:56:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:09,189 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2024-10-13 14:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 14:56:09,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-10-13 14:56:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:09,193 INFO L225 Difference]: With dead ends: 47 [2024-10-13 14:56:09,193 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 14:56:09,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 14:56:09,195 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:09,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 14:56:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 14:56:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-13 14:56:09,210 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 20 [2024-10-13 14:56:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:09,210 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-13 14:56:09,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 14:56:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-13 14:56:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 14:56:09,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:09,213 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:56:09,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 14:56:09,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1433936301, now seen corresponding path program 1 times [2024-10-13 14:56:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259734913] [2024-10-13 14:56:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 14:56:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 14:56:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 14:56:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 14:56:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259734913] [2024-10-13 14:56:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259734913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:09,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625921995] [2024-10-13 14:56:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:09,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:09,420 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 14:56:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:09,451 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-13 14:56:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-13 14:56:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:09,454 INFO L225 Difference]: With dead ends: 46 [2024-10-13 14:56:09,455 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 14:56:09,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-13 14:56:09,456 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:09,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 14:56:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 14:56:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 14:56:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-13 14:56:09,470 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 36 [2024-10-13 14:56:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:09,470 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-13 14:56:09,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 14:56:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-13 14:56:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 14:56:09,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:09,473 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:56:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 14:56:09,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 14:56:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1433936045, now seen corresponding path program 1 times [2024-10-13 14:56:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196060134] [2024-10-13 14:56:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 14:56:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 14:56:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 14:56:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 14:56:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 14:56:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 14:56:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196060134] [2024-10-13 14:56:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196060134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:09,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816313684] [2024-10-13 14:56:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:09,610 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 14:56:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:09,636 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-13 14:56:09,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:09,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-13 14:56:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:09,637 INFO L225 Difference]: With dead ends: 42 [2024-10-13 14:56:09,637 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 14:56:09,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-13 14:56:09,640 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:09,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 14:56:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 14:56:09,645 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-13 14:56:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 14:56:09,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-10-13 14:56:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:09,645 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 14:56:09,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 14:56:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 14:56:09,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 14:56:09,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 14:56:09,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 14:56:09,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 14:56:09,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 14:56:09,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 14:56:09,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 14:56:09,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 14:56:09,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 14:56:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 14:56:09,656 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 14:56:09,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 14:56:09,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:56:09,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:56:09 BoogieIcfgContainer [2024-10-13 14:56:09,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:56:09,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:56:09,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:56:09,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:56:09,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:07" (3/4) ... [2024-10-13 14:56:09,714 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 14:56:09,718 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 14:56:09,718 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrueOrFalse [2024-10-13 14:56:09,718 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 14:56:09,724 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 14:56:09,724 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 14:56:09,725 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 14:56:09,725 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 14:56:09,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 14:56:09,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 14:56:09,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:56:09,827 INFO L158 Benchmark]: Toolchain (without parser) took 3517.78ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 99.5MB in the beginning and 130.4MB in the end (delta: -30.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,827 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:09,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1109.51ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 99.1MB in the beginning and 163.3MB in the end (delta: -64.2MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.19ms. Allocated memory is still 232.8MB. Free memory was 163.3MB in the beginning and 160.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,829 INFO L158 Benchmark]: Boogie Preprocessor took 42.44ms. Allocated memory is still 232.8MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,829 INFO L158 Benchmark]: RCFGBuilder took 409.83ms. Allocated memory is still 232.8MB. Free memory was 158.0MB in the beginning and 140.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,830 INFO L158 Benchmark]: TraceAbstraction took 1763.05ms. Allocated memory is still 232.8MB. Free memory was 139.2MB in the beginning and 136.7MB in the end (delta: 2.5MB). Peak memory consumption was 392.8kB. Max. memory is 16.1GB. [2024-10-13 14:56:09,830 INFO L158 Benchmark]: Witness Printer took 115.38ms. Allocated memory is still 232.8MB. Free memory was 136.7MB in the beginning and 130.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 14:56:09,832 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.14ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1109.51ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 99.1MB in the beginning and 163.3MB in the end (delta: -64.2MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.19ms. Allocated memory is still 232.8MB. Free memory was 163.3MB in the beginning and 160.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.44ms. Allocated memory is still 232.8MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.83ms. Allocated memory is still 232.8MB. Free memory was 158.0MB in the beginning and 140.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1763.05ms. Allocated memory is still 232.8MB. Free memory was 139.2MB in the beginning and 136.7MB in the end (delta: 2.5MB). Peak memory consumption was 392.8kB. Max. memory is 16.1GB. * Witness Printer took 115.38ms. Allocated memory is still 232.8MB. Free memory was 136.7MB in the beginning and 130.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: 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, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 788 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 309 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 32/32 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 14:56:09,867 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