./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.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 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:25:20,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:25:20,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:25:20,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:25:20,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:25:20,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:25:20,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:25:20,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:25:20,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:25:20,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:25:20,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:25:20,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:25:20,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:25:20,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:25:20,447 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:25:20,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:25:20,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:25:20,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:25:20,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:25:20,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:25:20,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:25:20,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:25:20,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:25:20,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:25:20,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:25:20,456 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:25:20,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:25:20,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:25:20,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:25:20,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:25:20,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:25:20,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:25:20,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:25:20,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:25:20,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:25:20,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:25:20,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:25:20,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:25:20,459 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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2024-10-13 13:25:20,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:25:20,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:25:20,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:25:20,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:25:20,738 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:25:20,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-10-13 13:25:22,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:25:22,234 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:25:22,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-10-13 13:25:22,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203ef15ec/647c46e4302e4c61a369f9787a027123/FLAG7c149eb99 [2024-10-13 13:25:22,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203ef15ec/647c46e4302e4c61a369f9787a027123 [2024-10-13 13:25:22,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:25:22,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:25:22,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:25:22,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:25:22,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:25:22,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b38ab04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22, skipping insertion in model container [2024-10-13 13:25:22,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:25:22,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:25:22,837 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:25:22,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:25:22,877 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:25:22,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22 WrapperNode [2024-10-13 13:25:22,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:25:22,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:25:22,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:25:22,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:25:22,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,917 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-13 13:25:22,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:25:22,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:25:22,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:25:22,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:25:22,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,940 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-10-13 13:25:22,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:25:22,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:25:22,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:25:22,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:25:22,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (1/1) ... [2024-10-13 13:25:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:25:22,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:22,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:25:22,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:25:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:25:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 13:25:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 13:25:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:25:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:25:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:25:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 13:25:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 13:25:23,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:25:23,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:25:23,208 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 13:25:23,209 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:25:23,224 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:25:23,225 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:25:23,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23 BoogieIcfgContainer [2024-10-13 13:25:23,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:25:23,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:25:23,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:25:23,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:25:23,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:25:22" (1/3) ... [2024-10-13 13:25:23,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7010454d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:25:23, skipping insertion in model container [2024-10-13 13:25:23,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:25:22" (2/3) ... [2024-10-13 13:25:23,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7010454d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:25:23, skipping insertion in model container [2024-10-13 13:25:23,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23" (3/3) ... [2024-10-13 13:25:23,231 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2024-10-13 13:25:23,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:25:23,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 13:25:23,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:25:23,371 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;@51b6a6c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:25:23,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 13:25:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 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-10-13 13:25:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:25:23,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,384 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-10-13 13:25:23,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1641202500, now seen corresponding path program 1 times [2024-10-13 13:25:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019452500] [2024-10-13 13:25:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019452500] [2024-10-13 13:25:23,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019452500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:23,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:25:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041298024] [2024-10-13 13:25:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:23,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 13:25:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 13:25:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 13:25:23,591 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 13:25:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:23,622 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2024-10-13 13:25:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 13:25:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 14 [2024-10-13 13:25:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:23,631 INFO L225 Difference]: With dead ends: 63 [2024-10-13 13:25:23,632 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:25:23,635 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-10-13 13:25:23,639 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:23,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:25:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:25:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) 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-10-13 13:25:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-13 13:25:23,671 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-10-13 13:25:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:23,672 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-13 13:25:23,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 13:25:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-13 13:25:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:25:23,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,673 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:25:23,674 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-10-13 13:25:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1895441916, now seen corresponding path program 1 times [2024-10-13 13:25:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419014291] [2024-10-13 13:25:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419014291] [2024-10-13 13:25:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419014291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:25:23,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086716324] [2024-10-13 13:25:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:25:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:25:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:25:23,815 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:23,851 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-10-13 13:25:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 14 [2024-10-13 13:25:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:23,852 INFO L225 Difference]: With dead ends: 47 [2024-10-13 13:25:23,852 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 13:25:23,853 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-10-13 13:25:23,854 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:23,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 13:25:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 13:25:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) 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-10-13 13:25:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-13 13:25:23,859 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2024-10-13 13:25:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:23,860 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-13 13:25:23,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-13 13:25:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 13:25:23,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:23,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:25:23,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 367584173, now seen corresponding path program 1 times [2024-10-13 13:25:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942705515] [2024-10-13 13:25:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942705515] [2024-10-13 13:25:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942705515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:25:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985271805] [2024-10-13 13:25:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:23,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:25:23,984 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,072 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-13 13:25:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:25:24,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 19 [2024-10-13 13:25:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,073 INFO L225 Difference]: With dead ends: 51 [2024-10-13 13:25:24,074 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 13:25:24,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:25:24,075 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:24,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 13:25:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2024-10-13 13:25:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-13 13:25:24,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 19 [2024-10-13 13:25:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,091 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-13 13:25:24,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-13 13:25:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 13:25:24,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,092 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:25:24,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 367585423, now seen corresponding path program 1 times [2024-10-13 13:25:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310475463] [2024-10-13 13:25:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310475463] [2024-10-13 13:25:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310475463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476253499] [2024-10-13 13:25:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:24,217 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-10-13 13:25:24,219 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-10-13 13:25:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:25:24,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476253499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:25:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913005733] [2024-10-13 13:25:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:25:24,341 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,366 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-13 13:25:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:25:24,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 19 [2024-10-13 13:25:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,368 INFO L225 Difference]: With dead ends: 52 [2024-10-13 13:25:24,368 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 13:25:24,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:25:24,369 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:24,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 13:25:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2024-10-13 13:25:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-13 13:25:24,375 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2024-10-13 13:25:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,375 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-13 13:25:24,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-13 13:25:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 13:25:24,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:25:24,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:24,577 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-10-13 13:25:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1489792460, now seen corresponding path program 1 times [2024-10-13 13:25:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127537628] [2024-10-13 13:25:24,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127537628] [2024-10-13 13:25:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127537628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:25:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:25:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721304410] [2024-10-13 13:25:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:25:24,650 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-10-13 13:25:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,710 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-13 13:25:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:25:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-10-13 13:25:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,711 INFO L225 Difference]: With dead ends: 52 [2024-10-13 13:25:24,711 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 13:25:24,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:25:24,712 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:24,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 13:25:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-13 13:25:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-13 13:25:24,717 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 20 [2024-10-13 13:25:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,717 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-13 13:25:24,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-10-13 13:25:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-10-13 13:25:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 13:25:24,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:25:24,718 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-10-13 13:25:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1489753731, now seen corresponding path program 1 times [2024-10-13 13:25:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559813495] [2024-10-13 13:25:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559813495] [2024-10-13 13:25:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559813495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962058011] [2024-10-13 13:25:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:24,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:24,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:24,783 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-10-13 13:25:24,784 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-10-13 13:25:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:24,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:25:24,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:24,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:24,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962058011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:24,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:24,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-13 13:25:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498049752] [2024-10-13 13:25:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:24,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:25:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:25:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:25:24,847 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-13 13:25:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:24,892 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-13 13:25:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-13 13:25:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:24,893 INFO L225 Difference]: With dead ends: 51 [2024-10-13 13:25:24,893 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 13:25:24,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:25:24,894 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 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-10-13 13:25:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 13:25:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-10-13 13:25:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-13 13:25:24,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 20 [2024-10-13 13:25:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:24,903 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-13 13:25:24,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-10-13 13:25:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-13 13:25:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:25:24,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:24,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:24,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:25,104 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,SelfDestructingSolverStorable5 [2024-10-13 13:25:25,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1356283532, now seen corresponding path program 1 times [2024-10-13 13:25:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:25,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233927255] [2024-10-13 13:25:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:25,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233927255] [2024-10-13 13:25:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233927255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890907671] [2024-10-13 13:25:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:25,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:25,175 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-10-13 13:25:25,176 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-10-13 13:25:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:25:25,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890907671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:25,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:25,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-13 13:25:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607970163] [2024-10-13 13:25:25,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:25,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:25:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:25:25,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:25:25,319 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:25:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:25,409 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-10-13 13:25:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:25:25,410 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 23 [2024-10-13 13:25:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:25,411 INFO L225 Difference]: With dead ends: 82 [2024-10-13 13:25:25,411 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 13:25:25,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:25:25,412 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:25,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 106 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 13:25:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-10-13 13:25:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 13:25:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-13 13:25:25,418 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 23 [2024-10-13 13:25:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:25,418 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-13 13:25:25,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:25:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-13 13:25:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 13:25:25,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:25,419 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:25,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:25:25,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:25,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:25,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash 904934402, now seen corresponding path program 1 times [2024-10-13 13:25:25,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:25,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682004657] [2024-10-13 13:25:25,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682004657] [2024-10-13 13:25:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682004657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:25,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082377375] [2024-10-13 13:25:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:25,709 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-10-13 13:25:25,711 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-10-13 13:25:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:25,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:25:25,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:25,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:25:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082377375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:25:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:25:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-13 13:25:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120508085] [2024-10-13 13:25:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:25:25,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:25:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:25:25,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:25:25,798 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:25,854 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-13 13:25:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:25:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 24 [2024-10-13 13:25:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:25,855 INFO L225 Difference]: With dead ends: 59 [2024-10-13 13:25:25,855 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 13:25:25,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:25:25,856 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:25,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:25:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 13:25:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2024-10-13 13:25:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-10-13 13:25:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-10-13 13:25:25,861 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2024-10-13 13:25:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-10-13 13:25:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 13:25:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-10-13 13:25:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:25:25,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:25,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:25,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:26,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,063 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-10-13 13:25:26,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2011804545, now seen corresponding path program 1 times [2024-10-13 13:25:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626774666] [2024-10-13 13:25:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626774666] [2024-10-13 13:25:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626774666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507888846] [2024-10-13 13:25:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:26,155 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-10-13 13:25:26,160 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-10-13 13:25:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:25:26,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507888846] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:26,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-10-13 13:25:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603413932] [2024-10-13 13:25:26,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:25:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:25:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:25:26,332 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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-10-13 13:25:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:26,552 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-10-13 13:25:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 13:25:26,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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 25 [2024-10-13 13:25:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:26,554 INFO L225 Difference]: With dead ends: 76 [2024-10-13 13:25:26,554 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 13:25:26,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:25:26,555 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:26,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 162 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 13:25:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-13 13:25:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 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-10-13 13:25:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-13 13:25:26,561 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 25 [2024-10-13 13:25:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:26,562 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-13 13:25:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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-10-13 13:25:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-13 13:25:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 13:25:26,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:26,563 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] [2024-10-13 13:25:26,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:25:26,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,768 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-10-13 13:25:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1808115458, now seen corresponding path program 1 times [2024-10-13 13:25:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381531756] [2024-10-13 13:25:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 13:25:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:25:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 13:25:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:25:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381531756] [2024-10-13 13:25:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381531756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012653912] [2024-10-13 13:25:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:26,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:26,996 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-10-13 13:25:26,997 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-10-13 13:25:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:27,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 13:25:27,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:27,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 13:25:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012653912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:27,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-13 13:25:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123116035] [2024-10-13 13:25:27,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 13:25:27,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 13:25:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-10-13 13:25:27,417 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 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-10-13 13:25:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:27,909 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2024-10-13 13:25:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 13:25:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 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 53 [2024-10-13 13:25:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:27,911 INFO L225 Difference]: With dead ends: 222 [2024-10-13 13:25:27,911 INFO L226 Difference]: Without dead ends: 221 [2024-10-13 13:25:27,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 13:25:27,913 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 196 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:27,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 242 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:25:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-13 13:25:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2024-10-13 13:25:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 140 states have internal predecessors, (158), 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-10-13 13:25:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2024-10-13 13:25:27,926 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 53 [2024-10-13 13:25:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:27,927 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2024-10-13 13:25:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 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-10-13 13:25:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2024-10-13 13:25:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 13:25:27,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:27,929 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] [2024-10-13 13:25:27,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:25:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:28,130 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-10-13 13:25:28,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1200701576, now seen corresponding path program 1 times [2024-10-13 13:25:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652092453] [2024-10-13 13:25:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:28,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 13:25:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 13:25:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652092453] [2024-10-13 13:25:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652092453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91609032] [2024-10-13 13:25:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:28,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:28,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:28,285 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-10-13 13:25:28,290 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-10-13 13:25:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:28,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 13:25:28,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:28,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91609032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:28,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 25 [2024-10-13 13:25:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670499622] [2024-10-13 13:25:28,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 13:25:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 13:25:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:25:28,567 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 13:25:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:28,819 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2024-10-13 13:25:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 13:25:28,819 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2024-10-13 13:25:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:28,820 INFO L225 Difference]: With dead ends: 248 [2024-10-13 13:25:28,820 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 13:25:28,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=576, Invalid=1230, Unknown=0, NotChecked=0, Total=1806 [2024-10-13 13:25:28,822 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:28,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 156 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:25:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 13:25:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2024-10-13 13:25:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.1411764705882352) internal successors, (194), 170 states have internal predecessors, (194), 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-10-13 13:25:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2024-10-13 13:25:28,843 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 61 [2024-10-13 13:25:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:28,844 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2024-10-13 13:25:28,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 13:25:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2024-10-13 13:25:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 13:25:28,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:28,846 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] [2024-10-13 13:25:28,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:29,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:29,047 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-10-13 13:25:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1728550616, now seen corresponding path program 2 times [2024-10-13 13:25:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567213624] [2024-10-13 13:25:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 13:25:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:25:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567213624] [2024-10-13 13:25:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567213624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722691101] [2024-10-13 13:25:29,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:25:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:29,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:25:29,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:25:29,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:25:29,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 13:25:29,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:29,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:25:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722691101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:30,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 45 [2024-10-13 13:25:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623710894] [2024-10-13 13:25:30,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:30,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 13:25:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 13:25:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1433, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 13:25:30,301 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 13:25:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:31,259 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2024-10-13 13:25:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-13 13:25:31,259 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-10-13 13:25:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:31,263 INFO L225 Difference]: With dead ends: 328 [2024-10-13 13:25:31,265 INFO L226 Difference]: Without dead ends: 302 [2024-10-13 13:25:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2146, Invalid=4660, Unknown=0, NotChecked=0, Total=6806 [2024-10-13 13:25:31,272 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 229 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 241 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:25:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-13 13:25:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 248. [2024-10-13 13:25:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 220 states have (on average 1.1545454545454545) internal successors, (254), 220 states have internal predecessors, (254), 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-10-13 13:25:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2024-10-13 13:25:31,298 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 91 [2024-10-13 13:25:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:31,299 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2024-10-13 13:25:31,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-13 13:25:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2024-10-13 13:25:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 13:25:31,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:31,300 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] [2024-10-13 13:25:31,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:31,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 13:25:31,502 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-10-13 13:25:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1708158849, now seen corresponding path program 1 times [2024-10-13 13:25:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446216698] [2024-10-13 13:25:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:31,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 13:25:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 13:25:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 13:25:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 13:25:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 13:25:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 13:25:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 13:25:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 13:25:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 13:25:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446216698] [2024-10-13 13:25:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446216698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95670655] [2024-10-13 13:25:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:32,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 13:25:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:32,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 13:25:32,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:32,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 13:25:33,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95670655] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:33,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 66 [2024-10-13 13:25:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034216023] [2024-10-13 13:25:33,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-13 13:25:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-13 13:25:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=3410, Unknown=0, NotChecked=0, Total=4422 [2024-10-13 13:25:33,336 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 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-10-13 13:25:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:34,851 INFO L93 Difference]: Finished difference Result 632 states and 718 transitions. [2024-10-13 13:25:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-13 13:25:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 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 113 [2024-10-13 13:25:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:34,854 INFO L225 Difference]: With dead ends: 632 [2024-10-13 13:25:34,854 INFO L226 Difference]: Without dead ends: 631 [2024-10-13 13:25:34,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3742 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-10-13 13:25:34,858 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 490 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:34,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 392 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:25:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-13 13:25:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 413. [2024-10-13 13:25:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 355 states have (on average 1.1380281690140845) internal successors, (404), 355 states have internal predecessors, (404), 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-10-13 13:25:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 462 transitions. [2024-10-13 13:25:34,876 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 462 transitions. Word has length 113 [2024-10-13 13:25:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 462 transitions. [2024-10-13 13:25:34,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 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-10-13 13:25:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 462 transitions. [2024-10-13 13:25:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 13:25:34,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:34,879 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:34,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 13:25:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 13:25:35,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:35,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1128118700, now seen corresponding path program 2 times [2024-10-13 13:25:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082541025] [2024-10-13 13:25:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 13:25:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 13:25:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 13:25:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 13:25:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 13:25:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 13:25:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 13:25:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 13:25:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 13:25:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 13:25:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 13:25:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 13:25:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 13:25:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 13:25:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 13:25:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-13 13:25:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-13 13:25:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-13 13:25:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1115 proven. 25 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-13 13:25:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082541025] [2024-10-13 13:25:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082541025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485374395] [2024-10-13 13:25:36,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:25:36,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:36,435 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:36,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 13:25:36,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:25:36,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:25:36,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 13:25:36,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1735 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:25:36,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1123 proven. 17 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-13 13:25:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485374395] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:37,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:37,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43, 44] total 47 [2024-10-13 13:25:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506802182] [2024-10-13 13:25:37,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:37,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-13 13:25:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-13 13:25:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 13:25:37,512 INFO L87 Difference]: Start difference. First operand 413 states and 462 transitions. Second operand has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) [2024-10-13 13:25:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:38,440 INFO L93 Difference]: Finished difference Result 619 states and 686 transitions. [2024-10-13 13:25:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-13 13:25:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) Word has length 228 [2024-10-13 13:25:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:38,444 INFO L225 Difference]: With dead ends: 619 [2024-10-13 13:25:38,444 INFO L226 Difference]: Without dead ends: 322 [2024-10-13 13:25:38,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 452 SyntacticMatches, 41 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1940, Invalid=5542, Unknown=0, NotChecked=0, Total=7482 [2024-10-13 13:25:38,449 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 97 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:38,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1767 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:25:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-13 13:25:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-10-13 13:25:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 261 states have (on average 1.1111111111111112) internal successors, (290), 261 states have internal predecessors, (290), 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-10-13 13:25:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2024-10-13 13:25:38,489 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 228 [2024-10-13 13:25:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:38,489 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2024-10-13 13:25:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) [2024-10-13 13:25:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2024-10-13 13:25:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-13 13:25:38,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:25:38,500 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:38,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 13:25:38,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 13:25:38,701 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 13:25:38,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:25:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -492707838, now seen corresponding path program 2 times [2024-10-13 13:25:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:25:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987490679] [2024-10-13 13:25:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:25:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:25:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 13:25:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:25:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 13:25:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 13:25:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 13:25:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 13:25:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 13:25:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 13:25:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 13:25:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 13:25:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 13:25:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 13:25:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 13:25:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 13:25:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 13:25:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 13:25:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 13:25:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 13:25:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 13:25:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 13:25:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 13:25:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 13:25:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-13 13:25:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-13 13:25:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-13 13:25:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-13 13:25:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-13 13:25:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-13 13:25:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-13 13:25:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:25:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 356 proven. 7 refuted. 0 times theorem prover too weak. 3583 trivial. 0 not checked. [2024-10-13 13:25:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:25:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987490679] [2024-10-13 13:25:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987490679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:25:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625771747] [2024-10-13 13:25:39,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:25:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:25:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:25:39,312 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:25:39,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 13:25:39,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:25:39,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:25:39,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 13:25:39,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:25:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 3622 proven. 19 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-13 13:25:40,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:25:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2330 proven. 19 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2024-10-13 13:25:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625771747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:25:41,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:25:41,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 43, 44] total 49 [2024-10-13 13:25:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715065145] [2024-10-13 13:25:41,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:25:41,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-13 13:25:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:25:41,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-13 13:25:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1855, Unknown=0, NotChecked=0, Total=2352 [2024-10-13 13:25:41,632 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-10-13 13:25:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:25:42,852 INFO L93 Difference]: Finished difference Result 319 states and 348 transitions. [2024-10-13 13:25:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-13 13:25:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) Word has length 317 [2024-10-13 13:25:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:25:42,853 INFO L225 Difference]: With dead ends: 319 [2024-10-13 13:25:42,853 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:25:42,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 627 SyntacticMatches, 41 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2960, Invalid=9250, Unknown=0, NotChecked=0, Total=12210 [2024-10-13 13:25:42,857 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 112 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 13:25:42,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1434 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 13:25:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:25:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:25:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:25:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:25:42,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2024-10-13 13:25:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:25:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:25:42,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-10-13 13:25:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:25:42,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:25:42,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 13:25:42,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 13:25:42,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 13:25:42,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 13:25:42,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 13:25:43,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 13:25:43,070 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:25:43,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:25:43,988 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:25:44,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:25:44 BoogieIcfgContainer [2024-10-13 13:25:44,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:25:44,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:25:44,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:25:44,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:25:44,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:25:23" (3/4) ... [2024-10-13 13:25:44,018 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:25:44,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 13:25:44,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 13:25:44,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 13:25:44,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 13:25:44,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 13:25:44,024 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:25:44,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:25:44,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:25:44,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:25:44,108 INFO L158 Benchmark]: Toolchain (without parser) took 21453.18ms. Allocated memory was 190.8MB in the beginning and 423.6MB in the end (delta: 232.8MB). Free memory was 123.6MB in the beginning and 245.5MB in the end (delta: -121.9MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.92ms. Allocated memory is still 190.8MB. Free memory was 123.4MB in the beginning and 111.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.84ms. Allocated memory is still 190.8MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 190.8MB. Free memory was 109.7MB in the beginning and 108.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: RCFGBuilder took 273.44ms. Allocated memory is still 190.8MB. Free memory was 108.1MB in the beginning and 94.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: TraceAbstraction took 20784.61ms. Allocated memory was 190.8MB in the beginning and 423.6MB in the end (delta: 232.8MB). Free memory was 94.3MB in the beginning and 250.7MB in the end (delta: -156.4MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,109 INFO L158 Benchmark]: Witness Printer took 96.28ms. Allocated memory is still 423.6MB. Free memory was 250.7MB in the beginning and 245.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:25:44,110 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.96ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.92ms. Allocated memory is still 190.8MB. Free memory was 123.4MB in the beginning and 111.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.84ms. Allocated memory is still 190.8MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 190.8MB. Free memory was 109.7MB in the beginning and 108.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.44ms. Allocated memory is still 190.8MB. Free memory was 108.1MB in the beginning and 94.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20784.61ms. Allocated memory was 190.8MB in the beginning and 423.6MB in the end (delta: 232.8MB). Free memory was 94.3MB in the beginning and 250.7MB in the end (delta: -156.4MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. * Witness Printer took 96.28ms. Allocated memory is still 423.6MB. Free memory was 250.7MB in the beginning and 245.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1555 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1555 mSDsluCounter, 5019 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4392 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 627 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2507 GetRequests, 1827 SyntacticMatches, 86 SemanticMatches, 594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13525 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=13, InterpolantAutomatonStates: 435, 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, 15 MinimizatonAttempts, 403 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 2015 NumberOfCodeBlocks, 2015 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2892 ConstructedInterpolants, 0 QuantifiedInterpolants, 6290 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2363 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 17487/19437 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: (((((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) || ((20 <= counter) && (counter <= 2147483646))) || ((counter <= 22) && (4 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((counter <= 20) && (3 <= counter)) || (counter == 0)) || (counter == 1)) || (counter == 2)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:25:44,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE