./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.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/nla-digbench-scaling/divbin_unwindbound10.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 b879e9957df47aa9212d1bcb19c90b87b865d954f1a44f3c044747ce0553d2eb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:39:21,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:39:21,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:39:21,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:39:21,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:39:21,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:39:21,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:39:21,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:39:21,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:39:21,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:39:21,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:39:21,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:39:21,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:39:21,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:39:21,712 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:39:21,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:39:21,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:39:21,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:39:21,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:39:21,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:39:21,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:39:21,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:39:21,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:39:21,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:39:21,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:39:21,719 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:39:21,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:39:21,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:39:21,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:39:21,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:39:21,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:39:21,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:39:21,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:39:21,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:39:21,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:21,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:39:21,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:39:21,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:39:21,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:39:21,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:39:21,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:39:21,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:39:21,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:39:21,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:39:21,725 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 -> b879e9957df47aa9212d1bcb19c90b87b865d954f1a44f3c044747ce0553d2eb [2024-11-09 11:39:21,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:39:22,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:39:22,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:39:22,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:39:22,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:39:22,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i [2024-11-09 11:39:23,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:39:23,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:39:23,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound10.i [2024-11-09 11:39:23,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816dd03c6/fbfb5163a5694f7c929f8696510656e0/FLAGbd67beb23 [2024-11-09 11:39:24,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816dd03c6/fbfb5163a5694f7c929f8696510656e0 [2024-11-09 11:39:24,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:39:24,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:39:24,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:24,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:39:24,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:39:24,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c571539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24, skipping insertion in model container [2024-11-09 11:39:24,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:39:24,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:24,323 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:39:24,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:39:24,352 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:39:24,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24 WrapperNode [2024-11-09 11:39:24,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:39:24,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:24,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:39:24,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:39:24,360 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:39:24" (1/1) ... [2024-11-09 11:39:24,366 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:39:24" (1/1) ... [2024-11-09 11:39:24,381 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-09 11:39:24,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:39:24,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:39:24,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:39:24,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:39:24,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,401 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:39:24,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:39:24,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:39:24,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:39:24,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:39:24,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (1/1) ... [2024-11-09 11:39:24,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:39:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:24,456 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:39:24,459 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:39:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:39:24,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:39:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:39:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:39:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:39:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:39:24,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:39:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:39:24,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:39:24,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:39:24,749 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 11:39:24,751 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:39:24,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:39:24,767 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:39:24,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24 BoogieIcfgContainer [2024-11-09 11:39:24,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:39:24,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:39:24,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:39:24,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:39:24,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:39:24" (1/3) ... [2024-11-09 11:39:24,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477384db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:24, skipping insertion in model container [2024-11-09 11:39:24,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:39:24" (2/3) ... [2024-11-09 11:39:24,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477384db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:39:24, skipping insertion in model container [2024-11-09 11:39:24,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24" (3/3) ... [2024-11-09 11:39:24,779 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound10.i [2024-11-09 11:39:24,797 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:39:24,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:39:24,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:39:24,871 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;@e7d9112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:39:24,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:39:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:39:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:24,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:24,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:24,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:24,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-09 11:39:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67688465] [2024-11-09 11:39:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67688465] [2024-11-09 11:39:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67688465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:39:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7162391] [2024-11-09 11:39:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:39:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:39:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:25,087 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,103 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-09 11:39:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:39:25,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 11:39:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,110 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:39:25,110 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 11:39:25,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:39:25,115 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 11:39:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 11:39:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 11:39:25,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-09 11:39:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,148 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 11:39:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:39:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 11:39:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:39:25,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,149 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:39:25,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-09 11:39:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009714165] [2024-11-09 11:39:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009714165] [2024-11-09 11:39:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009714165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981034807] [2024-11-09 11:39:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:25,318 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,365 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 11:39:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:39:25,367 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-09 11:39:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,368 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:39:25,368 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:39:25,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:25,370 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:39:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-09 11:39:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 11:39:25,381 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-09 11:39:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,383 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 11:39:25,383 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 11:39:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:39:25,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:39:25,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,386 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-09 11:39:25,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157031699] [2024-11-09 11:39:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157031699] [2024-11-09 11:39:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157031699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:39:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467726904] [2024-11-09 11:39:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:39:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:39:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:39:25,541 INFO L87 Difference]: Start difference. First operand 28 states and 32 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,584 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-09 11:39:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:25,584 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-09 11:39:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,585 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:39:25,586 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:39:25,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:25,587 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:39:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:39:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 11:39:25,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-09 11:39:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,598 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 11:39:25,598 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 11:39:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:39:25,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:39:25,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-09 11:39:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475610546] [2024-11-09 11:39:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475610546] [2024-11-09 11:39:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475610546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349471634] [2024-11-09 11:39:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:25,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:25,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:25,783 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:25,969 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 11:39:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:39:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:39:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:25,971 INFO L225 Difference]: With dead ends: 32 [2024-11-09 11:39:25,972 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:39:25,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:25,974 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:25,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:39:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 11:39:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 11:39:25,985 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-11-09 11:39:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:25,986 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 11:39:25,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 11:39:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:25,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:25,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:25,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:39:25,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-09 11:39:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969643806] [2024-11-09 11:39:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969643806] [2024-11-09 11:39:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969643806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58887097] [2024-11-09 11:39:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:39:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:39:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:26,103 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:26,186 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-09 11:39:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:39:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:26,188 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:39:26,188 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:39:26,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:26,189 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:26,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:39:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-09 11:39:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 11:39:26,195 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2024-11-09 11:39:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:26,196 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 11:39:26,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 11:39:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:39:26,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:26,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:39:26,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-09 11:39:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939218004] [2024-11-09 11:39:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939218004] [2024-11-09 11:39:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939218004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682351751] [2024-11-09 11:39:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:26,303 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:39:26,314 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:39:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:39:26,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:39:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682351751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:26,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:39:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:39:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420655355] [2024-11-09 11:39:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:39:26,452 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:26,508 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 11:39:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:39:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:26,510 INFO L225 Difference]: With dead ends: 39 [2024-11-09 11:39:26,510 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 11:39:26,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:39:26,512 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:26,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 11:39:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-09 11:39:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 11:39:26,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2024-11-09 11:39:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:26,524 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 11:39:26,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:39:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 11:39:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:39:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:26,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:26,544 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:39:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:39:26,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-09 11:39:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427480429] [2024-11-09 11:39:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427480429] [2024-11-09 11:39:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427480429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477653572] [2024-11-09 11:39:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:26,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:26,809 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:39:26,810 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:39:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:26,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:39:26,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477653572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:26,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:26,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:39:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199572251] [2024-11-09 11:39:26,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:26,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:39:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:39:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:39:26,990 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:27,090 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-09 11:39:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:39:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2024-11-09 11:39:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:27,092 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:39:27,092 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:39:27,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:39:27,094 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:27,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:39:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-09 11:39:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:39:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-09 11:39:27,107 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2024-11-09 11:39:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:27,107 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-09 11:39:27,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:39:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-09 11:39:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:39:27,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:27,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:27,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:39:27,312 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,SelfDestructingSolverStorable6 [2024-11-09 11:39:27,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269756, now seen corresponding path program 1 times [2024-11-09 11:39:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368626844] [2024-11-09 11:39:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368626844] [2024-11-09 11:39:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368626844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152268683] [2024-11-09 11:39:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:27,440 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:39:27,444 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:39:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:27,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:39:27,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152268683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:27,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 11:39:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439887042] [2024-11-09 11:39:27,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:39:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:39:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:39:27,689 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:27,954 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-09 11:39:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:39:27,955 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-11-09 11:39:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:27,956 INFO L225 Difference]: With dead ends: 77 [2024-11-09 11:39:27,956 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 11:39:27,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-09 11:39:27,957 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:27,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 11:39:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-09 11:39:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:39:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-09 11:39:27,966 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2024-11-09 11:39:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:27,967 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-09 11:39:27,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:39:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-09 11:39:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:39:27,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:27,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:27,985 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:39:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:28,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:28,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 749470151, now seen corresponding path program 1 times [2024-11-09 11:39:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370540052] [2024-11-09 11:39:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:39:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:39:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:39:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:28,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370540052] [2024-11-09 11:39:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370540052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829489483] [2024-11-09 11:39:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:28,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:28,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:28,447 INFO L229 MonitoredProcess]: Starting monitored process 5 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:39:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:39:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:28,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:39:28,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:28,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:39:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829489483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:28,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 11:39:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260942869] [2024-11-09 11:39:28,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:28,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 11:39:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 11:39:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:39:28,963 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:29,609 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-09 11:39:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 11:39:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2024-11-09 11:39:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:29,613 INFO L225 Difference]: With dead ends: 223 [2024-11-09 11:39:29,614 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 11:39:29,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 11:39:29,617 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 226 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:29,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 198 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:39:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 11:39:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2024-11-09 11:39:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2024-11-09 11:39:29,640 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2024-11-09 11:39:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:29,643 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2024-11-09 11:39:29,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 11:39:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2024-11-09 11:39:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:39:29,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:29,645 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:29,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:39:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:29,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1527022909, now seen corresponding path program 1 times [2024-11-09 11:39:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461879394] [2024-11-09 11:39:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 11:39:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:39:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461879394] [2024-11-09 11:39:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461879394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:30,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597225419] [2024-11-09 11:39:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:30,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:30,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:30,077 INFO L229 MonitoredProcess]: Starting monitored process 6 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:39:30,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:39:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:30,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:39:30,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:30,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:39:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597225419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:30,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-09 11:39:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612066246] [2024-11-09 11:39:30,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:39:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:39:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:39:30,379 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:30,740 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2024-11-09 11:39:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:39:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-09 11:39:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:30,742 INFO L225 Difference]: With dead ends: 249 [2024-11-09 11:39:30,742 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 11:39:30,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:39:30,744 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 179 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:30,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 136 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:39:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 11:39:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 199. [2024-11-09 11:39:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 171 states have internal predecessors, (195), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 223 transitions. [2024-11-09 11:39:30,772 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 223 transitions. Word has length 62 [2024-11-09 11:39:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:30,772 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 223 transitions. [2024-11-09 11:39:30,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 11:39:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 223 transitions. [2024-11-09 11:39:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 11:39:30,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:30,777 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:30,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:39:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 11:39:30,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1343796701, now seen corresponding path program 2 times [2024-11-09 11:39:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508416941] [2024-11-09 11:39:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-09 11:39:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508416941] [2024-11-09 11:39:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508416941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:39:31,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:39:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:39:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944576160] [2024-11-09 11:39:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:39:31,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:39:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:39:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:39:31,088 INFO L87 Difference]: Start difference. First operand 199 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:39:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:31,124 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2024-11-09 11:39:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:39:31,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2024-11-09 11:39:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:31,126 INFO L225 Difference]: With dead ends: 225 [2024-11-09 11:39:31,126 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 11:39:31,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:39:31,127 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:31,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:39:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 11:39:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2024-11-09 11:39:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:39:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2024-11-09 11:39:31,137 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 92 [2024-11-09 11:39:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:31,138 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2024-11-09 11:39:31,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:39:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2024-11-09 11:39:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 11:39:31,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:31,139 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:31,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:39:31,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:31,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:31,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1694985668, now seen corresponding path program 1 times [2024-11-09 11:39:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932654288] [2024-11-09 11:39:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 11:39:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:39:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 11:39:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 11:39:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 11:39:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 11:39:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:39:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:39:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 11:39:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932654288] [2024-11-09 11:39:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932654288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438146027] [2024-11-09 11:39:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:31,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:31,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:31,792 INFO L229 MonitoredProcess]: Starting monitored process 7 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:39:31,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:39:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:31,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 11:39:31,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:39:32,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 11:39:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438146027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:33,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 64 [2024-11-09 11:39:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503855674] [2024-11-09 11:39:33,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-09 11:39:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-09 11:39:33,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=3219, Unknown=0, NotChecked=0, Total=4160 [2024-11-09 11:39:33,363 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-09 11:39:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:35,270 INFO L93 Difference]: Finished difference Result 533 states and 600 transitions. [2024-11-09 11:39:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-09 11:39:35,271 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 114 [2024-11-09 11:39:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:35,274 INFO L225 Difference]: With dead ends: 533 [2024-11-09 11:39:35,278 INFO L226 Difference]: Without dead ends: 532 [2024-11-09 11:39:35,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4347, Invalid=11403, Unknown=0, NotChecked=0, Total=15750 [2024-11-09 11:39:35,285 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 512 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:35,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 347 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:39:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-09 11:39:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 325. [2024-11-09 11:39:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 267 states have (on average 1.1161048689138577) internal successors, (298), 267 states have internal predecessors, (298), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 11:39:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 356 transitions. [2024-11-09 11:39:35,305 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 356 transitions. Word has length 114 [2024-11-09 11:39:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 356 transitions. [2024-11-09 11:39:35,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.390625) internal successors, (217), 65 states have internal predecessors, (217), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-11-09 11:39:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 356 transitions. [2024-11-09 11:39:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 11:39:35,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:39:35,311 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:35,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:39:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:35,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:39:35,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:39:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1939354457, now seen corresponding path program 2 times [2024-11-09 11:39:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:39:35,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334602969] [2024-11-09 11:39:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:39:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:39:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:39:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:39:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:39:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 11:39:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:39:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 11:39:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 11:39:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 11:39:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 11:39:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:39:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:39:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 11:39:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-09 11:39:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 11:39:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:39:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-09 11:39:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-09 11:39:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-09 11:39:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 11:39:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-09 11:39:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-09 11:39:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:39:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 244 proven. 7 refuted. 0 times theorem prover too weak. 1706 trivial. 0 not checked. [2024-11-09 11:39:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:39:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334602969] [2024-11-09 11:39:35,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334602969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:39:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592505806] [2024-11-09 11:39:35,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:39:35,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:35,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:39:35,878 INFO L229 MonitoredProcess]: Starting monitored process 8 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:39:35,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:39:36,038 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:39:36,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:39:36,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:39:36,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:39:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1231 proven. 7 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-09 11:39:36,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:39:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 811 proven. 7 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2024-11-09 11:39:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592505806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:39:36,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:39:36,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 24] total 29 [2024-11-09 11:39:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352630608] [2024-11-09 11:39:36,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:39:36,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 11:39:36,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:39:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 11:39:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:39:36,843 INFO L87 Difference]: Start difference. First operand 325 states and 356 transitions. Second operand has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-09 11:39:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:39:37,677 INFO L93 Difference]: Finished difference Result 840 states and 919 transitions. [2024-11-09 11:39:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 11:39:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 240 [2024-11-09 11:39:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:39:37,679 INFO L225 Difference]: With dead ends: 840 [2024-11-09 11:39:37,679 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:39:37,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 487 SyntacticMatches, 21 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=918, Invalid=3504, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 11:39:37,684 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:39:37,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 896 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:39:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:39:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:39:37,685 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:39:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:39:37,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2024-11-09 11:39:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:39:37,687 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:39:37,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.551724137931035) internal successors, (132), 29 states have internal predecessors, (132), 12 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2024-11-09 11:39:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:39:37,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:39:37,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:39:37,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:39:37,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:39:37,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:39:37,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:39:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:39:37,894 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:39:37,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:39:39,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:39:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:39:39 BoogieIcfgContainer [2024-11-09 11:39:39,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:39:39,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:39:39,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:39:39,469 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:39:39,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:39:24" (3/4) ... [2024-11-09 11:39:39,472 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:39:39,475 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 11:39:39,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:39:39,479 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 11:39:39,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:39:39,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:39:39,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:39:39,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:39:39,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:39:39,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:39:39,577 INFO L158 Benchmark]: Toolchain (without parser) took 15512.24ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 83.1MB in the beginning and 195.8MB in the end (delta: -112.6MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,577 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:39,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.38ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 118.0MB in the end (delta: -35.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.82ms. Allocated memory is still 151.0MB. Free memory was 118.0MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:39:39,578 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 151.0MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,578 INFO L158 Benchmark]: RCFGBuilder took 348.38ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 102.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,578 INFO L158 Benchmark]: TraceAbstraction took 14693.99ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 102.0MB in the beginning and 201.0MB in the end (delta: -99.0MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,578 INFO L158 Benchmark]: Witness Printer took 110.14ms. Allocated memory is still 268.4MB. Free memory was 201.0MB in the beginning and 195.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:39:39,579 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.19ms. Allocated memory is still 96.5MB. Free memory was 65.3MB in the beginning and 65.2MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.38ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 118.0MB in the end (delta: -35.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.82ms. Allocated memory is still 151.0MB. Free memory was 118.0MB in the beginning and 116.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 151.0MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.38ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 102.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14693.99ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 102.0MB in the beginning and 201.0MB in the end (delta: -99.0MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. * Witness Printer took 110.14ms. Allocated memory is still 268.4MB. Free memory was 201.0MB in the beginning and 195.8MB 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1227 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1227 mSDsluCounter, 2331 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1939 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1633 IncrementalHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 392 mSDtfsCounter, 1633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1441 GetRequests, 1059 SyntacticMatches, 21 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5928 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1758 ConstructedInterpolants, 0 QuantifiedInterpolants, 3306 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1314 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 6538/7604 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 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((11 <= counter) && (counter <= 2147483645)) || ((counter <= 3) && (1 <= counter))) || ((counter <= 10) && (3 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((2 <= counter) && (counter <= 10)) || (counter == 0)) || (counter == 1)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:39:39,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE