./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_multiply_02_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_multiply_02_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 f04c94e9825c0ac99c5a0fda48444f0ae5a6924fd6905231643918113e76d83a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 23:02:15,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 23:02:15,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 23:02:15,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 23:02:15,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 23:02:15,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 23:02:15,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 23:02:15,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 23:02:15,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 23:02:15,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 23:02:15,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 23:02:15,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 23:02:15,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 23:02:15,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 23:02:15,497 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 23:02:15,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 23:02:15,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 23:02:15,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 23:02:15,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 23:02:15,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 23:02:15,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 23:02:15,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 23:02:15,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 23:02:15,504 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 23:02:15,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 23:02:15,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 23:02:15,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 23:02:15,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 23:02:15,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 23:02:15,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 23:02:15,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 23:02:15,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:02:15,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 23:02:15,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 23:02:15,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 23:02:15,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 23:02:15,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 23:02:15,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 23:02:15,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 23:02:15,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 23:02:15,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 23:02:15,511 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 -> f04c94e9825c0ac99c5a0fda48444f0ae5a6924fd6905231643918113e76d83a [2024-10-14 23:02:15,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 23:02:15,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 23:02:15,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 23:02:15,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 23:02:15,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 23:02:15,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_02_good.i [2024-10-14 23:02:17,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 23:02:17,634 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 23:02:17,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_multiply_02_good.i [2024-10-14 23:02:17,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f403ce2d3/7175c2f53b144f0f8b48b50da3efce4b/FLAG482726c86 [2024-10-14 23:02:17,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f403ce2d3/7175c2f53b144f0f8b48b50da3efce4b [2024-10-14 23:02:17,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 23:02:17,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 23:02:17,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 23:02:17,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 23:02:17,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 23:02:17,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:02:17" (1/1) ... [2024-10-14 23:02:17,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6daab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:17, skipping insertion in model container [2024-10-14 23:02:17,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:02:17" (1/1) ... [2024-10-14 23:02:17,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 23:02:18,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:02:18,445 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 23:02:18,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 23:02:18,697 INFO L204 MainTranslator]: Completed translation [2024-10-14 23:02:18,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18 WrapperNode [2024-10-14 23:02:18,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 23:02:18,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 23:02:18,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 23:02:18,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 23:02:18,718 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:02:18" (1/1) ... [2024-10-14 23:02:18,809 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:02:18" (1/1) ... [2024-10-14 23:02:18,838 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2024-10-14 23:02:18,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 23:02:18,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 23:02:18,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 23:02:18,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 23:02:18,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,868 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 23:02:18,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 23:02:18,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 23:02:18,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 23:02:18,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 23:02:18,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (1/1) ... [2024-10-14 23:02:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 23:02:18,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 23:02:18,933 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:02:18,936 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:02:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-14 23:02:18,982 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-14 23:02:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-14 23:02:18,982 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-14 23:02:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 23:02:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 23:02:18,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 23:02:19,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 23:02:19,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 23:02:19,323 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-14 23:02:19,323 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 23:02:19,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 23:02:19,354 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 23:02:19,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:02:19 BoogieIcfgContainer [2024-10-14 23:02:19,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 23:02:19,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 23:02:19,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 23:02:19,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 23:02:19,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:02:17" (1/3) ... [2024-10-14 23:02:19,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709cef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:02:19, skipping insertion in model container [2024-10-14 23:02:19,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:02:18" (2/3) ... [2024-10-14 23:02:19,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709cef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:02:19, skipping insertion in model container [2024-10-14 23:02:19,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:02:19" (3/3) ... [2024-10-14 23:02:19,362 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_multiply_02_good.i [2024-10-14 23:02:19,376 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 23:02:19,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 23:02:19,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 23:02:19,453 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;@5db014dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 23:02:19,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 23:02:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.605263157894737) internal successors, (61), 46 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 23:02:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 23:02:19,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:19,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:19,472 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-14 23:02:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1980620567, now seen corresponding path program 1 times [2024-10-14 23:02:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620941848] [2024-10-14 23:02:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:19,785 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:02:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620941848] [2024-10-14 23:02:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620941848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:19,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276523972] [2024-10-14 23:02:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:19,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:19,823 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.605263157894737) internal successors, (61), 46 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:19,886 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2024-10-14 23:02:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:19,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:19,896 INFO L225 Difference]: With dead ends: 109 [2024-10-14 23:02:19,897 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 23:02:19,900 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:02:19,904 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:02:19,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 23:02:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 23:02:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 39 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-10-14 23:02:19,942 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 12 [2024-10-14 23:02:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-10-14 23:02:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-10-14 23:02:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 23:02:19,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:19,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:19,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 23:02:19,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1269695500, now seen corresponding path program 1 times [2024-10-14 23:02:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502721969] [2024-10-14 23:02:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,043 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:02:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502721969] [2024-10-14 23:02:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502721969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831468146] [2024-10-14 23:02:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,053 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,077 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-14 23:02:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,078 INFO L225 Difference]: With dead ends: 48 [2024-10-14 23:02:20,079 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 23:02:20,079 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:02:20,081 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 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:02:20,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 23:02:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 23:02:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-10-14 23:02:20,095 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 13 [2024-10-14 23:02:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-10-14 23:02:20,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-10-14 23:02:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 23:02:20,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 23:02:20,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:20,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 879083411, now seen corresponding path program 1 times [2024-10-14 23:02:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849668827] [2024-10-14 23:02:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,212 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:02:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849668827] [2024-10-14 23:02:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849668827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093490122] [2024-10-14 23:02:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,217 INFO L87 Difference]: Start difference. First operand 47 states and 56 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,247 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-10-14 23:02:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,249 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-14 23:02:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,250 INFO L225 Difference]: With dead ends: 47 [2024-10-14 23:02:20,250 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 23:02:20,251 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:02:20,252 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:02:20,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 23:02:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 23:02:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-10-14 23:02:20,264 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 15 [2024-10-14 23:02:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-10-14 23:02:20,265 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-10-14 23:02:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 23:02:20,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 23:02:20,266 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-14 23:02:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1481782061, now seen corresponding path program 1 times [2024-10-14 23:02:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894198613] [2024-10-14 23:02:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,325 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:02:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894198613] [2024-10-14 23:02:20,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894198613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903318817] [2024-10-14 23:02:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,329 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,353 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-10-14 23:02:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-14 23:02:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,358 INFO L225 Difference]: With dead ends: 46 [2024-10-14 23:02:20,358 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 23:02:20,358 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:02:20,359 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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:02:20,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 23:02:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 23:02:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-10-14 23:02:20,368 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2024-10-14 23:02:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-10-14 23:02:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-10-14 23:02:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 23:02:20,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 23:02:20,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:20,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1294060726, now seen corresponding path program 1 times [2024-10-14 23:02:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570949154] [2024-10-14 23:02:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,418 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:02:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570949154] [2024-10-14 23:02:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570949154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885069098] [2024-10-14 23:02:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,421 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,441 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-10-14 23:02:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 23:02:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,442 INFO L225 Difference]: With dead ends: 45 [2024-10-14 23:02:20,442 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 23:02:20,442 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:02:20,443 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:02:20,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 23:02:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 23:02:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-10-14 23:02:20,449 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 17 [2024-10-14 23:02:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,449 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-10-14 23:02:20,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-10-14 23:02:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 23:02:20,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:20,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 23:02:20,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1461176715, now seen corresponding path program 1 times [2024-10-14 23:02:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454463574] [2024-10-14 23:02:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,493 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:02:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454463574] [2024-10-14 23:02:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454463574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620323033] [2024-10-14 23:02:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,496 INFO L87 Difference]: Start difference. First operand 44 states and 53 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,512 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-10-14 23:02:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,513 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-14 23:02:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,514 INFO L225 Difference]: With dead ends: 51 [2024-10-14 23:02:20,514 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 23:02:20,514 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:02:20,515 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:02:20,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 23:02:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 23:02:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-14 23:02:20,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 18 [2024-10-14 23:02:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,521 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-14 23:02:20,521 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 23:02:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-14 23:02:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 23:02:20,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,522 INFO L215 NwaCegarLoop]: trace histogram [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-14 23:02:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 23:02:20,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1717763082, now seen corresponding path program 1 times [2024-10-14 23:02:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423157164] [2024-10-14 23:02:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:02:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,580 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:02:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423157164] [2024-10-14 23:02:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423157164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105849237] [2024-10-14 23:02:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,583 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 23:02:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,603 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-14 23:02:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-14 23:02:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,604 INFO L225 Difference]: With dead ends: 43 [2024-10-14 23:02:20,604 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 23:02:20,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:02:20,606 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 23:02:20,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 23:02:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 23:02:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 23:02:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-14 23:02:20,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2024-10-14 23:02:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,614 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-14 23:02:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 23:02:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-10-14 23:02:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 23:02:20,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 23:02:20,615 INFO L215 NwaCegarLoop]: trace histogram [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-14 23:02:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 23:02:20,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 23:02:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 23:02:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1711048141, now seen corresponding path program 1 times [2024-10-14 23:02:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 23:02:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71453640] [2024-10-14 23:02:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 23:02:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 23:02:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 23:02:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 23:02:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 23:02:20,680 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:02:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 23:02:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71453640] [2024-10-14 23:02:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71453640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 23:02:20,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 23:02:20,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 23:02:20,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046110805] [2024-10-14 23:02:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 23:02:20,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 23:02:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 23:02:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 23:02:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 23:02:20,685 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 23:02:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 23:02:20,702 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-14 23:02:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 23:02:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-14 23:02:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 23:02:20,703 INFO L225 Difference]: With dead ends: 42 [2024-10-14 23:02:20,703 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 23:02:20,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:02:20,705 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 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:02:20,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 23:02:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 23:02:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 23:02:20,706 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:02:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 23:02:20,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-10-14 23:02:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 23:02:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 23:02:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 23:02:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 23:02:20,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 23:02:20,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 23:02:20,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 23:02:20,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 23:02:20,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 23:02:20,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 23:02:20,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 23:02:20,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 23:02:20,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 23:02:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 23:02:20,724 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 23:02:20,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 23:02:20,762 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 23:02:20,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:02:20 BoogieIcfgContainer [2024-10-14 23:02:20,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 23:02:20,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 23:02:20,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 23:02:20,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 23:02:20,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:02:19" (3/4) ... [2024-10-14 23:02:20,787 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 23:02:20,791 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-14 23:02:20,792 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-14 23:02:20,799 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-14 23:02:20,799 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-14 23:02:20,800 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 23:02:20,800 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 23:02:20,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 23:02:20,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 23:02:20,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 23:02:20,884 INFO L158 Benchmark]: Toolchain (without parser) took 3207.34ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 74.4MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,884 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 23:02:20,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1026.12ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 140.5MB in the end (delta: 9.3MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.16ms. Allocated memory is still 180.4MB. Free memory was 140.5MB in the beginning and 137.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,884 INFO L158 Benchmark]: Boogie Preprocessor took 48.57ms. Allocated memory is still 180.4MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,885 INFO L158 Benchmark]: RCFGBuilder took 462.91ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 118.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,885 INFO L158 Benchmark]: TraceAbstraction took 1424.32ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 79.6MB in the end (delta: 37.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,885 INFO L158 Benchmark]: Witness Printer took 99.63ms. Allocated memory is still 180.4MB. Free memory was 79.6MB in the beginning and 74.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 23:02:20,887 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.16ms. Allocated memory is still 125.8MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1026.12ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 140.5MB in the end (delta: 9.3MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.16ms. Allocated memory is still 180.4MB. Free memory was 140.5MB in the beginning and 137.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.57ms. Allocated memory is still 180.4MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.91ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 118.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1424.32ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 79.6MB in the end (delta: 37.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 99.63ms. Allocated memory is still 180.4MB. Free memory was 79.6MB in the beginning and 74.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: 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 3 procedures, 59 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 744 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 389 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 24, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-14 23:02:20,927 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