./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.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 abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 18:04:08,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 18:04:08,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 18:04:08,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 18:04:08,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 18:04:08,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 18:04:08,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 18:04:08,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 18:04:08,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 18:04:08,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 18:04:08,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 18:04:08,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 18:04:08,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 18:04:08,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 18:04:08,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 18:04:08,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 18:04:08,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 18:04:08,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 18:04:08,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 18:04:08,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 18:04:08,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 18:04:08,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 18:04:08,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 18:04:08,917 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 18:04:08,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 18:04:08,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 18:04:08,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 18:04:08,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 18:04:08,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 18:04:08,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:04:08,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 18:04:08,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 18:04:08,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 18:04:08,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 18:04:08,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 18:04:08,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 18:04:08,921 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 -> abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e [2024-11-20 18:04:09,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 18:04:09,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 18:04:09,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 18:04:09,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 18:04:09,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 18:04:09,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-11-20 18:04:10,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 18:04:10,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 18:04:10,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-11-20 18:04:10,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0fd36d9/55c9646d55dd4d5d8c5f241a28a5efd0/FLAG5172e7c53 [2024-11-20 18:04:10,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0fd36d9/55c9646d55dd4d5d8c5f241a28a5efd0 [2024-11-20 18:04:10,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 18:04:10,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 18:04:10,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 18:04:10,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 18:04:10,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 18:04:10,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:04:10" (1/1) ... [2024-11-20 18:04:10,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e75d8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:10, skipping insertion in model container [2024-11-20 18:04:10,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:04:10" (1/1) ... [2024-11-20 18:04:11,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 18:04:11,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:04:11,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 18:04:11,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 18:04:11,142 INFO L204 MainTranslator]: Completed translation [2024-11-20 18:04:11,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11 WrapperNode [2024-11-20 18:04:11,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 18:04:11,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 18:04:11,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 18:04:11,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 18:04:11,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,161 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-20 18:04:11,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 18:04:11,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 18:04:11,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 18:04:11,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 18:04:11,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,173 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 18:04:11,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 18:04:11,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 18:04:11,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 18:04:11,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 18:04:11,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (1/1) ... [2024-11-20 18:04:11,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 18:04:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 18:04:11,207 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-20 18:04:11,209 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-20 18:04:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 18:04:11,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 18:04:11,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 18:04:11,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 18:04:11,359 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 18:04:11,359 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 18:04:11,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 18:04:11,368 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 18:04:11,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:11 BoogieIcfgContainer [2024-11-20 18:04:11,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 18:04:11,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 18:04:11,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 18:04:11,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 18:04:11,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:04:10" (1/3) ... [2024-11-20 18:04:11,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f65cb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:04:11, skipping insertion in model container [2024-11-20 18:04:11,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:11" (2/3) ... [2024-11-20 18:04:11,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f65cb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:04:11, skipping insertion in model container [2024-11-20 18:04:11,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:11" (3/3) ... [2024-11-20 18:04:11,380 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2024-11-20 18:04:11,394 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 18:04:11,394 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-20 18:04:11,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 18:04:11,475 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;@3b69c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 18:04:11,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-20 18:04:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 29 states have internal predecessors, (34), 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-20 18:04:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 18:04:11,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:04:11,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 18:04:11,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-20 18:04:11,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:04:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2024-11-20 18:04:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:04:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106417040] [2024-11-20 18:04:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:04:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:04:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:04:11,593 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-20 18:04:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:04:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106417040] [2024-11-20 18:04:11,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106417040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:04:11,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:04:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 18:04:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150088348] [2024-11-20 18:04:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:04:11,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 18:04:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:04:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 18:04:11,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 18:04:11,620 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 29 states have internal predecessors, (34), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 18:04:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:04:11,657 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-20 18:04:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 18:04:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-20 18:04:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:04:11,667 INFO L225 Difference]: With dead ends: 57 [2024-11-20 18:04:11,667 INFO L226 Difference]: Without dead ends: 25 [2024-11-20 18:04:11,673 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-20 18:04:11,675 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:04:11,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:04:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-20 18:04:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-20 18:04:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.6875) internal successors, (27), 24 states have internal predecessors, (27), 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-20 18:04:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-20 18:04:11,695 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 4 [2024-11-20 18:04:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:04:11,695 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-20 18:04:11,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 18:04:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-20 18:04:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 18:04:11,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:04:11,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 18:04:11,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 18:04:11,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-20 18:04:11,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:04:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2024-11-20 18:04:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:04:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693894919] [2024-11-20 18:04:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:04:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:04:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:04:11,717 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-20 18:04:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:04:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693894919] [2024-11-20 18:04:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693894919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:04:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:04:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 18:04:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726390201] [2024-11-20 18:04:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:04:11,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 18:04:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:04:11,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 18:04:11,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 18:04:11,720 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-20 18:04:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:04:11,744 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-20 18:04:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 18:04:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-20 18:04:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:04:11,745 INFO L225 Difference]: With dead ends: 25 [2024-11-20 18:04:11,745 INFO L226 Difference]: Without dead ends: 23 [2024-11-20 18:04:11,745 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-20 18:04:11,746 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 18:04:11,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 18:04:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-20 18:04:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-20 18:04:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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-20 18:04:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-20 18:04:11,754 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2024-11-20 18:04:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:04:11,754 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-20 18:04:11,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-20 18:04:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-20 18:04:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 18:04:11,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:04:11,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 18:04:11,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 18:04:11,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-20 18:04:11,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:04:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2024-11-20 18:04:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:04:11,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264945334] [2024-11-20 18:04:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:04:11,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:04:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 18:04:11,815 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-20 18:04:11,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 18:04:11,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264945334] [2024-11-20 18:04:11,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264945334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 18:04:11,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 18:04:11,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 18:04:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540675822] [2024-11-20 18:04:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 18:04:11,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 18:04:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 18:04:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 18:04:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 18:04:11,818 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-20 18:04:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 18:04:11,911 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-20 18:04:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 18:04:11,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-11-20 18:04:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 18:04:11,912 INFO L225 Difference]: With dead ends: 38 [2024-11-20 18:04:11,913 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 18:04:11,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 18:04:11,914 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 18:04:11,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 18:04:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 18:04:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-20 18:04:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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-20 18:04:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-20 18:04:11,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 6 [2024-11-20 18:04:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 18:04:11,919 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-20 18:04:11,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-20 18:04:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-20 18:04:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 18:04:11,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 18:04:11,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 18:04:11,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 18:04:11,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-20 18:04:11,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 18:04:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2024-11-20 18:04:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 18:04:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125949372] [2024-11-20 18:04:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 18:04:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 18:04:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 18:04:11,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 18:04:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 18:04:11,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 18:04:11,950 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 18:04:11,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-11-20 18:04:11,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-11-20 18:04:11,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-11-20 18:04:11,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-11-20 18:04:11,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-11-20 18:04:11,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-11-20 18:04:11,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-11-20 18:04:11,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-11-20 18:04:11,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-11-20 18:04:11,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-11-20 18:04:11,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 18:04:11,955 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 18:04:11,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 18:04:11,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:04:11 BoogieIcfgContainer [2024-11-20 18:04:11,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 18:04:11,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 18:04:11,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 18:04:11,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 18:04:11,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:11" (3/4) ... [2024-11-20 18:04:11,975 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 18:04:12,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 18:04:12,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 18:04:12,005 INFO L158 Benchmark]: Toolchain (without parser) took 1017.20ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 89.6MB in the end (delta: 34.0MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,007 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 121.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 18:04:12,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.16ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 112.3MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.17ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,007 INFO L158 Benchmark]: Boogie Preprocessor took 18.28ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 109.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,008 INFO L158 Benchmark]: RCFGBuilder took 187.77ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,008 INFO L158 Benchmark]: TraceAbstraction took 603.03ms. Allocated memory is still 159.4MB. Free memory was 97.8MB in the beginning and 91.8MB in the end (delta: 5.9MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,009 INFO L158 Benchmark]: Witness Printer took 32.14ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 89.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 18:04:12,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 121.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.16ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 112.3MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.17ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 110.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.28ms. Allocated memory is still 159.4MB. Free memory was 110.8MB in the beginning and 109.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 187.77ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 98.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 603.03ms. Allocated memory is still 159.4MB. Free memory was 97.8MB in the beginning and 91.8MB in the end (delta: 5.9MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 32.14ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 89.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 19]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y; [L15] x = __VERIFIER_nondet_int() [L16] y = __VERIFIER_nondet_int() [L17] COND TRUE x >= 2 VAL [x=2, y=2147483647] [L18] EXPR x - 1 [L18] x = x - 1 VAL [x=1, y=2147483647] [L19] y + x - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 49 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 18:04:12,027 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)