./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/aaron2-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/termination-crafted/aaron2-1.c -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 246d09347c3a084eeabbdf966240b074edac2f7f1a00862cb8995171f6755d56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:08:18,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:08:18,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:08:18,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:08:18,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:08:18,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:08:18,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:08:18,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:08:18,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:08:18,359 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:08:18,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:08:18,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:08:18,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:08:18,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:08:18,361 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:08:18,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:08:18,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:08:18,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:08:18,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:08:18,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:08:18,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:08:18,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:08:18,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:08:18,363 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:08:18,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:08:18,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:08:18,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:08:18,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:08:18,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:08:18,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:08:18,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:08:18,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:08:18,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:08:18,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:08:18,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:08:18,366 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 -> 246d09347c3a084eeabbdf966240b074edac2f7f1a00862cb8995171f6755d56 [2024-11-19 10:08:18,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:08:18,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:08:18,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:08:18,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:08:18,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:08:18,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/aaron2-1.c [2024-11-19 10:08:19,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:08:19,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:08:19,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/aaron2-1.c [2024-11-19 10:08:19,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba87b4f6f/a05b9500ed0b4102a5dc725c05dc0cae/FLAG6b03e541d [2024-11-19 10:08:20,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba87b4f6f/a05b9500ed0b4102a5dc725c05dc0cae [2024-11-19 10:08:20,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:08:20,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:08:20,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:08:20,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:08:20,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:08:20,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478cc502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20, skipping insertion in model container [2024-11-19 10:08:20,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:08:20,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:08:20,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:08:20,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:08:20,576 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:08:20,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20 WrapperNode [2024-11-19 10:08:20,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:08:20,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:08:20,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:08:20,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:08:20,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,611 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-11-19 10:08:20,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:08:20,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:08:20,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:08:20,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:08:20,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,630 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 10:08:20,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:08:20,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:08:20,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:08:20,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:08:20,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (1/1) ... [2024-11-19 10:08:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:08:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:08:20,668 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-11-19 10:08:20,670 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-11-19 10:08:20,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:08:20,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:08:20,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:08:20,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:08:20,866 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 10:08:20,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:08:20,877 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:08:20,877 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 10:08:20,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:20 BoogieIcfgContainer [2024-11-19 10:08:20,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:08:20,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:08:20,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:08:20,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:08:20,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:08:20" (1/3) ... [2024-11-19 10:08:20,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9d257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:08:20, skipping insertion in model container [2024-11-19 10:08:20,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:08:20" (2/3) ... [2024-11-19 10:08:20,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9d257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:08:20, skipping insertion in model container [2024-11-19 10:08:20,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:20" (3/3) ... [2024-11-19 10:08:20,886 INFO L112 eAbstractionObserver]: Analyzing ICFG aaron2-1.c [2024-11-19 10:08:20,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:08:20,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 10:08:20,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:08:20,950 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;@2b420e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:08:20,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 10:08:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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-11-19 10:08:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:08:20,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:20,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:20,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:20,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash 179571890, now seen corresponding path program 1 times [2024-11-19 10:08:20,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:20,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988939700] [2024-11-19 10:08:20,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988939700] [2024-11-19 10:08:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988939700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:08:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098787125] [2024-11-19 10:08:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:08:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:08:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:08:21,193 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:08:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,247 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-19 10:08:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:08:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-11-19 10:08:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,255 INFO L225 Difference]: With dead ends: 47 [2024-11-19 10:08:21,256 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 10:08:21,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 10:08:21,262 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 10:08:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-11-19 10:08:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 29 states have internal predecessors, (36), 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-11-19 10:08:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-19 10:08:21,286 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 8 [2024-11-19 10:08:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,287 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-19 10:08:21,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 10:08:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-19 10:08:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:08:21,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:08:21,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 179571570, now seen corresponding path program 1 times [2024-11-19 10:08:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220254891] [2024-11-19 10:08:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220254891] [2024-11-19 10:08:21,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220254891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677687011] [2024-11-19 10:08:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:21,360 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 10:08:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,450 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-19 10:08:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:08:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2024-11-19 10:08:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,451 INFO L225 Difference]: With dead ends: 51 [2024-11-19 10:08:21,452 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 10:08:21,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,454 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 10:08:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2024-11-19 10:08:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 36 states have internal predecessors, (47), 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-11-19 10:08:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-19 10:08:21,462 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 8 [2024-11-19 10:08:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,463 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-19 10:08:21,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 10:08:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-19 10:08:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:08:21,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:08:21,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:21,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1271761367, now seen corresponding path program 1 times [2024-11-19 10:08:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911718127] [2024-11-19 10:08:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911718127] [2024-11-19 10:08:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911718127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30322314] [2024-11-19 10:08:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:21,523 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 10:08:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,585 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2024-11-19 10:08:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:08:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2024-11-19 10:08:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,587 INFO L225 Difference]: With dead ends: 76 [2024-11-19 10:08:21,588 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 10:08:21,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,589 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 10:08:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2024-11-19 10:08:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 58 states have internal predecessors, (80), 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-11-19 10:08:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2024-11-19 10:08:21,603 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 9 [2024-11-19 10:08:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,603 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2024-11-19 10:08:21,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 10:08:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2024-11-19 10:08:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:08:21,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:08:21,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 769896788, now seen corresponding path program 1 times [2024-11-19 10:08:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641943945] [2024-11-19 10:08:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641943945] [2024-11-19 10:08:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641943945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560808790] [2024-11-19 10:08:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:21,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:21,693 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-19 10:08:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,732 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2024-11-19 10:08:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:08:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2024-11-19 10:08:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,734 INFO L225 Difference]: With dead ends: 60 [2024-11-19 10:08:21,735 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 10:08:21,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,736 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 16 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 10:08:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-19 10:08:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.44) internal successors, (72), 55 states have internal predecessors, (72), 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-11-19 10:08:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2024-11-19 10:08:21,745 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 10 [2024-11-19 10:08:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2024-11-19 10:08:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-11-19 10:08:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-19 10:08:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 10:08:21,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:08:21,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash 769588948, now seen corresponding path program 1 times [2024-11-19 10:08:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460829260] [2024-11-19 10:08:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460829260] [2024-11-19 10:08:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460829260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:08:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307395477] [2024-11-19 10:08:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:08:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:08:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,801 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-11-19 10:08:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:21,884 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2024-11-19 10:08:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:08:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2024-11-19 10:08:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:21,885 INFO L225 Difference]: With dead ends: 70 [2024-11-19 10:08:21,885 INFO L226 Difference]: Without dead ends: 69 [2024-11-19 10:08:21,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:21,886 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:21,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 23 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:08:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-19 10:08:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-11-19 10:08:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 58 states have internal predecessors, (75), 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-11-19 10:08:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-19 10:08:21,892 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 10 [2024-11-19 10:08:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:21,892 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-19 10:08:21,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-11-19 10:08:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-19 10:08:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:08:21,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:21,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:21,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:08:21,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1903003271, now seen corresponding path program 1 times [2024-11-19 10:08:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405974111] [2024-11-19 10:08:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405974111] [2024-11-19 10:08:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405974111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:08:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464867495] [2024-11-19 10:08:21,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:08:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:08:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:21,953 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-11-19 10:08:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:22,008 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2024-11-19 10:08:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:08:22,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2024-11-19 10:08:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:22,010 INFO L225 Difference]: With dead ends: 60 [2024-11-19 10:08:22,010 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 10:08:22,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:08:22,013 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:22,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 11 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 10:08:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-11-19 10:08:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 57 states have internal predecessors, (72), 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-11-19 10:08:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-19 10:08:22,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 11 [2024-11-19 10:08:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:22,023 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-19 10:08:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-11-19 10:08:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-19 10:08:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:08:22,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:22,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:08:22,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:22,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1912546321, now seen corresponding path program 1 times [2024-11-19 10:08:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510005147] [2024-11-19 10:08:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510005147] [2024-11-19 10:08:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510005147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:08:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:08:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:08:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147268159] [2024-11-19 10:08:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:08:22,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:08:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:08:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:08:22,065 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 10:08:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:22,091 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-19 10:08:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:08:22,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2024-11-19 10:08:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:22,093 INFO L225 Difference]: With dead ends: 59 [2024-11-19 10:08:22,093 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:08:22,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:08:22,094 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:22,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:08:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-19 10:08:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 53 states have internal predecessors, (63), 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-11-19 10:08:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-11-19 10:08:22,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 11 [2024-11-19 10:08:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:22,105 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-11-19 10:08:22,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11-19 10:08:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-19 10:08:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 10:08:22,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:22,106 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:22,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:08:22,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:22,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1288335898, now seen corresponding path program 1 times [2024-11-19 10:08:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69383344] [2024-11-19 10:08:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69383344] [2024-11-19 10:08:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69383344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:08:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542607807] [2024-11-19 10:08:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:08:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:08:22,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:08:22,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:08:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:22,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:08:22,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:08:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:08:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542607807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:08:22,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:08:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 10:08:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773623729] [2024-11-19 10:08:22,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:08:22,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:08:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:08:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:22,338 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-11-19 10:08:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:22,439 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-19 10:08:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 10:08:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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) Word has length 20 [2024-11-19 10:08:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:22,444 INFO L225 Difference]: With dead ends: 63 [2024-11-19 10:08:22,444 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 10:08:22,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-19 10:08:22,445 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:22,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 30 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 10:08:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 30. [2024-11-19 10:08:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-11-19 10:08:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-19 10:08:22,453 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2024-11-19 10:08:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:22,453 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 10:08:22,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-11-19 10:08:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-19 10:08:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 10:08:22,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:08:22,454 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:22,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:08:22,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:08:22,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:08:22,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:08:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2074212433, now seen corresponding path program 1 times [2024-11-19 10:08:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:08:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296956129] [2024-11-19 10:08:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:08:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:08:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296956129] [2024-11-19 10:08:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296956129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:08:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357133021] [2024-11-19 10:08:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:08:22,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:08:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:08:22,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:08:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:08:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:08:22,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:08:22,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:08:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:08:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:08:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357133021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:08:22,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:08:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 10:08:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310316325] [2024-11-19 10:08:22,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:08:22,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:08:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:08:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:08:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:08:22,859 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 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-11-19 10:08:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:08:22,943 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-19 10:08:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:08:22,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 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) Word has length 21 [2024-11-19 10:08:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:08:22,944 INFO L225 Difference]: With dead ends: 36 [2024-11-19 10:08:22,944 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:08:22,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-19 10:08:22,945 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:08:22,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:08:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:08:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:08:22,945 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-11-19 10:08:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:08:22,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2024-11-19 10:08:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:08:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:08:22,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 10 states have internal predecessors, (39), 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-11-19 10:08:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:08:22,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:08:22,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 10:08:22,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 10:08:22,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:08:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 10:08:23,153 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:08:23,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:08:23,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:08:23,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:08:23 BoogieIcfgContainer [2024-11-19 10:08:23,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:08:23,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:08:23,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:08:23,312 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:08:23,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:08:20" (3/4) ... [2024-11-19 10:08:23,315 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:08:23,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 10:08:23,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:08:23,322 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 10:08:23,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:08:23,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:08:23,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:08:23,392 INFO L158 Benchmark]: Toolchain (without parser) took 3010.14ms. Allocated memory was 125.8MB in the beginning and 188.7MB in the end (delta: 62.9MB). Free memory was 56.4MB in the beginning and 114.1MB in the end (delta: -57.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,392 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:08:23,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.14ms. Allocated memory is still 125.8MB. Free memory was 56.4MB in the beginning and 45.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.04ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 45.0MB in the beginning and 129.0MB in the end (delta: -84.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,392 INFO L158 Benchmark]: Boogie Preprocessor took 25.12ms. Allocated memory is still 157.3MB. Free memory was 128.9MB in the beginning and 129.1MB in the end (delta: -143.8kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,392 INFO L158 Benchmark]: RCFGBuilder took 240.31ms. Allocated memory is still 157.3MB. Free memory was 129.1MB in the beginning and 117.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,393 INFO L158 Benchmark]: TraceAbstraction took 2430.52ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 116.5MB in the beginning and 119.4MB in the end (delta: -2.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,393 INFO L158 Benchmark]: Witness Printer took 79.45ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:08:23,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.14ms. Allocated memory is still 125.8MB. Free memory was 56.4MB in the beginning and 45.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.04ms. Allocated memory was 125.8MB in the beginning and 157.3MB in the end (delta: 31.5MB). Free memory was 45.0MB in the beginning and 129.0MB in the end (delta: -84.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.12ms. Allocated memory is still 157.3MB. Free memory was 128.9MB in the beginning and 129.1MB in the end (delta: -143.8kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 240.31ms. Allocated memory is still 157.3MB. Free memory was 129.1MB in the beginning and 117.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2430.52ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 116.5MB in the beginning and 119.4MB in the end (delta: -2.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 79.45ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 114.1MB in the end (delta: 4.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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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 1 procedures, 27 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 313 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 94 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=3, InterpolantAutomatonStates: 50, 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, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 643 SizeOfPredicates, 4 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 0/45 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 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((x <= 1073741823) && (0 <= ((long) 1073741823 + y))) && (tx <= 1073741823)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:08:23,419 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