./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/loop-lit/mine2017-ex4.6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 1fa7c9a8ed8874a508931184bf09b1ee30162cb6ccbf87de6b2ebe54845cfa76 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:26:47,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:26:47,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:26:47,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:26:47,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:26:47,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:26:47,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:26:47,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:26:47,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:26:47,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:26:47,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:26:47,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:26:47,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:26:47,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:26:47,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:26:47,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:26:47,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:26:47,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:26:47,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:26:47,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:26:47,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:26:47,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:26:47,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:26:47,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:26:47,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:26:47,944 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:26:47,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:26:47,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:26:47,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:26:47,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:26:47,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:26:47,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:26:47,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:26:47,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:26:47,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:47,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:26:47,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:26:47,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:26:47,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:26:47,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:26:47,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:26:47,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:26:47,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:26:47,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:26:47,949 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fa7c9a8ed8874a508931184bf09b1ee30162cb6ccbf87de6b2ebe54845cfa76 [2024-11-09 11:26:48,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:26:48,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:26:48,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:26:48,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:26:48,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:26:48,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.6.i [2024-11-09 11:26:49,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:26:50,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:26:50,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.6.i [2024-11-09 11:26:50,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5135afe6/7076dc7139d0463db1fa740cbdae7ad0/FLAG558f4f159 [2024-11-09 11:26:50,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5135afe6/7076dc7139d0463db1fa740cbdae7ad0 [2024-11-09 11:26:50,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:26:50,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:26:50,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:50,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:26:50,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:26:50,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfc94f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50, skipping insertion in model container [2024-11-09 11:26:50,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:26:50,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:50,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:26:50,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:26:50,307 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:26:50,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50 WrapperNode [2024-11-09 11:26:50,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:26:50,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:50,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:26:50,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:26:50,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,343 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-09 11:26:50,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:26:50,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:26:50,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:26:50,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:26:50,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:26:50,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:26:50,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:26:50,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:26:50,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:26:50,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (1/1) ... [2024-11-09 11:26:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:26:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:50,414 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-09 11:26:50,415 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-09 11:26:50,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:26:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:26:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:26:50,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:26:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:26:50,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:26:50,513 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:26:50,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:26:50,647 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 11:26:50,647 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:26:50,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:26:50,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:26:50,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:50 BoogieIcfgContainer [2024-11-09 11:26:50,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:26:50,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:26:50,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:26:50,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:26:50,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:26:50" (1/3) ... [2024-11-09 11:26:50,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2632d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:50, skipping insertion in model container [2024-11-09 11:26:50,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:26:50" (2/3) ... [2024-11-09 11:26:50,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2632d00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:26:50, skipping insertion in model container [2024-11-09 11:26:50,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:50" (3/3) ... [2024-11-09 11:26:50,667 INFO L112 eAbstractionObserver]: Analyzing ICFG mine2017-ex4.6.i [2024-11-09 11:26:50,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:26:50,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 11:26:50,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:26:50,758 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;@3ea48ff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:26:50,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 11:26:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:26:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:26:50,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:50,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:50,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:26:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2081783925, now seen corresponding path program 1 times [2024-11-09 11:26:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869222948] [2024-11-09 11:26:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 11:26:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,039 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-09 11:26:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869222948] [2024-11-09 11:26:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869222948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779356135] [2024-11-09 11:26:51,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:51,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:51,091 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:26:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:51,140 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2024-11-09 11:26:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:51,144 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 11:26:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:51,151 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:26:51,152 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 11:26:51,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:51,158 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:51,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 11:26:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 11:26:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:26:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 11:26:51,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2024-11-09 11:26:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:51,190 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 11:26:51,190 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:26:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 11:26:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 11:26:51,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:51,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:51,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:26:51,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:26:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash 110792282, now seen corresponding path program 1 times [2024-11-09 11:26:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046508465] [2024-11-09 11:26:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 11:26:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,262 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-09 11:26:51,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046508465] [2024-11-09 11:26:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046508465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:26:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:26:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:26:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931735325] [2024-11-09 11:26:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:26:51,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:26:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:51,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:26:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:51,267 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:26:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:51,290 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-09 11:26:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:26:51,293 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 11:26:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:51,294 INFO L225 Difference]: With dead ends: 18 [2024-11-09 11:26:51,294 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 11:26:51,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:26:51,297 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:51,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:26:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 11:26:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 11:26:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:26:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 11:26:51,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-09 11:26:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 11:26:51,308 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:26:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-09 11:26:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:26:51,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:51,310 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:26:51,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:26:51,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:26:51,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -691442761, now seen corresponding path program 1 times [2024-11-09 11:26:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:51,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842741582] [2024-11-09 11:26:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 11:26:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 11:26:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:26:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:26:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842741582] [2024-11-09 11:26:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842741582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148358348] [2024-11-09 11:26:51,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:51,509 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-09 11:26:51,511 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-09 11:26:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:51,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:26:51,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:26:51,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:26:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148358348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:51,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 11:26:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136368214] [2024-11-09 11:26:51,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:26:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:26:51,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:26:51,742 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 11:26:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:51,811 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2024-11-09 11:26:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:26:51,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2024-11-09 11:26:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:51,813 INFO L225 Difference]: With dead ends: 36 [2024-11-09 11:26:51,813 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:26:51,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:26:51,814 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:51,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:26:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:26:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:26:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-09 11:26:51,827 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2024-11-09 11:26:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:51,827 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-09 11:26:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 11:26:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-09 11:26:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 11:26:51,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:51,830 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2024-11-09 11:26:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:26:52,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:52,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:26:52,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 627214461, now seen corresponding path program 2 times [2024-11-09 11:26:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755075422] [2024-11-09 11:26:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 11:26:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 11:26:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:26:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:26:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:26:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:26:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:26:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 11:26:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755075422] [2024-11-09 11:26:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755075422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878018785] [2024-11-09 11:26:52,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:26:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:52,439 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-09 11:26:52,440 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-09 11:26:52,493 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:26:52,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:26:52,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:26:52,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 11:26:52,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 11:26:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878018785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:52,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-09 11:26:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405806173] [2024-11-09 11:26:52,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:26:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:26:52,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:26:52,853 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 states have internal predecessors, (44), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 11:26:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:52,994 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-11-09 11:26:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 11:26:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 states have internal predecessors, (44), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 66 [2024-11-09 11:26:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:52,997 INFO L225 Difference]: With dead ends: 72 [2024-11-09 11:26:52,997 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 11:26:52,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:26:53,000 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:53,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:26:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 11:26:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 11:26:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 11:26:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-11-09 11:26:53,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 66 [2024-11-09 11:26:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:53,022 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-11-09 11:26:53,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 states have internal predecessors, (44), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 11:26:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-09 11:26:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 11:26:53,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:26:53,028 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1] [2024-11-09 11:26:53,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:26:53,228 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,SelfDestructingSolverStorable3 [2024-11-09 11:26:53,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:26:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:26:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2053381001, now seen corresponding path program 3 times [2024-11-09 11:26:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:26:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895310340] [2024-11-09 11:26:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:26:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:26:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 11:26:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 11:26:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:26:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:26:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:26:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 11:26:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 11:26:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:26:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 11:26:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 11:26:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:26:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 11:26:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:26:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 11:26:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:26:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:26:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:26:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 11:26:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 11:26:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 11:26:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 11:26:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:26:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 11:26:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:26:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895310340] [2024-11-09 11:26:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895310340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:26:54,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105778264] [2024-11-09 11:26:54,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:26:54,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:54,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:26:54,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:26:54,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:26:54,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 11:26:54,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:26:54,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:26:54,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:26:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2024-11-09 11:26:54,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:26:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2024-11-09 11:26:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105778264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:26:54,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:26:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 30 [2024-11-09 11:26:54,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997631304] [2024-11-09 11:26:54,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:26:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 11:26:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:26:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 11:26:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2024-11-09 11:26:54,360 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 31 states have internal predecessors, (64), 14 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (27), 14 states have call predecessors, (27), 14 states have call successors, (27) [2024-11-09 11:26:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:26:54,580 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2024-11-09 11:26:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 11:26:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 31 states have internal predecessors, (64), 14 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (27), 14 states have call predecessors, (27), 14 states have call successors, (27) Word has length 150 [2024-11-09 11:26:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:26:54,582 INFO L225 Difference]: With dead ends: 81 [2024-11-09 11:26:54,582 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:26:54,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:26:54,595 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:26:54,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:26:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:26:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:26:54,596 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-09 11:26:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:26:54,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2024-11-09 11:26:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:26:54,599 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:26:54,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 31 states have internal predecessors, (64), 14 states have call successors, (25), 1 states have call predecessors, (25), 2 states have return successors, (27), 14 states have call predecessors, (27), 14 states have call successors, (27) [2024-11-09 11:26:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:26:54,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:26:54,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 11:26:54,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 11:26:54,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:26:54,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:26:54,806 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-09 11:26:54,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:26:54,965 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:26:54,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:26:54 BoogieIcfgContainer [2024-11-09 11:26:54,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:26:54,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:26:54,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:26:54,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:26:54,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:26:50" (3/4) ... [2024-11-09 11:26:54,990 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:26:54,993 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:26:54,996 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 11:26:54,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:26:54,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:26:54,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:26:55,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:26:55,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:26:55,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:26:55,078 INFO L158 Benchmark]: Toolchain (without parser) took 5042.36ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 128.8MB in the beginning and 141.0MB in the end (delta: -12.2MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,078 INFO L158 Benchmark]: CDTParser took 1.91ms. Allocated memory is still 109.1MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:55,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.41ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 116.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.24ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 115.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,079 INFO L158 Benchmark]: Boogie Preprocessor took 36.50ms. Allocated memory is still 163.6MB. Free memory was 115.1MB in the beginning and 114.1MB in the end (delta: 942.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:26:55,080 INFO L158 Benchmark]: RCFGBuilder took 277.99ms. Allocated memory is still 163.6MB. Free memory was 114.1MB in the beginning and 131.9MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,080 INFO L158 Benchmark]: TraceAbstraction took 4325.63ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 131.3MB in the beginning and 146.2MB in the end (delta: -14.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,080 INFO L158 Benchmark]: Witness Printer took 90.46ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 141.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:26:55,082 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.91ms. Allocated memory is still 109.1MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.41ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 116.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.24ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 115.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.50ms. Allocated memory is still 163.6MB. Free memory was 115.1MB in the beginning and 114.1MB in the end (delta: 942.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.99ms. Allocated memory is still 163.6MB. Free memory was 114.1MB in the beginning and 131.9MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4325.63ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 131.3MB in the beginning and 146.2MB in the end (delta: -14.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 90.46ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 141.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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 2 procedures, 22 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 53 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 70, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 501 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 3602/4086 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 2 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((0 <= x) && (x <= 40)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:26:55,108 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