./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c -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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:15:04,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:15:04,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 11:15:04,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:15:04,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:15:04,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:15:04,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:15:04,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:15:04,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:15:04,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:15:04,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:15:04,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:15:04,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:15:04,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:15:04,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:15:04,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:15:04,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:15:04,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:15:04,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:15:04,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:15:04,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:15:04,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:15:04,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:15:04,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:15:04,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:15:04,290 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:15:04,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:15:04,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:15:04,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:15:04,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:15:04,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:15:04,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:15:04,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:15:04,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:15:04,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:04,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:15:04,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:15:04,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:15:04,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:15:04,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:15:04,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:15:04,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:15:04,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:15:04,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:15:04,296 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2024-11-19 11:15:04,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:15:04,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:15:04,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:15:04,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:15:04,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:15:04,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:06,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:15:06,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:15:06,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:06,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e538e3f/f1e82f22fe1c49bbacf090b5ecc58680/FLAGa7a7f1e17 [2024-11-19 11:15:06,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e538e3f/f1e82f22fe1c49bbacf090b5ecc58680 [2024-11-19 11:15:06,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:15:06,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:15:06,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:06,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:15:06,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:15:06,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2614cb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06, skipping insertion in model container [2024-11-19 11:15:06,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:15:06,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:06,633 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:15:06,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:06,694 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:15:06,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06 WrapperNode [2024-11-19 11:15:06,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:06,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:06,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:15:06,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:15:06,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,739 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 433 [2024-11-19 11:15:06,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:06,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:15:06,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:15:06,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:15:06,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 11:15:06,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:15:06,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:15:06,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:15:06,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:15:06,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (1/1) ... [2024-11-19 11:15:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:06,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:06,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 11:15:06,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 11:15:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:15:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-19 11:15:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-19 11:15:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-19 11:15:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-19 11:15:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-19 11:15:06,872 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-19 11:15:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-19 11:15:06,873 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-19 11:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-19 11:15:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-19 11:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 11:15:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 11:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:15:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:15:06,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:15:06,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:15:07,667 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-19 11:15:07,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:15:07,685 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:15:07,685 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 11:15:07,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:07 BoogieIcfgContainer [2024-11-19 11:15:07,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:15:07,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:15:07,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:15:07,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:15:07,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:15:06" (1/3) ... [2024-11-19 11:15:07,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5179d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:07, skipping insertion in model container [2024-11-19 11:15:07,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:06" (2/3) ... [2024-11-19 11:15:07,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5179d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:07, skipping insertion in model container [2024-11-19 11:15:07,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:07" (3/3) ... [2024-11-19 11:15:07,694 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:07,710 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:15:07,710 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 11:15:07,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:15:07,771 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;@45f721c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:15:07,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 11:15:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 11:15:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 11:15:07,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:07,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:07,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:07,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 462902644, now seen corresponding path program 1 times [2024-11-19 11:15:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502149316] [2024-11-19 11:15:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502149316] [2024-11-19 11:15:08,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502149316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:08,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:08,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:15:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512984653] [2024-11-19 11:15:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:08,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:08,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:08,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:08,076 INFO L87 Difference]: Start difference. First operand has 195 states, 143 states have (on average 1.6013986013986015) internal successors, (229), 155 states have internal predecessors, (229), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:15:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:08,173 INFO L93 Difference]: Finished difference Result 406 states and 669 transitions. [2024-11-19 11:15:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 11:15:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:08,186 INFO L225 Difference]: With dead ends: 406 [2024-11-19 11:15:08,187 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 11:15:08,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:15:08,197 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 37 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:08,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 874 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 11:15:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2024-11-19 11:15:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.5751633986928104) internal successors, (241), 164 states have internal predecessors, (241), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 11:15:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-11-19 11:15:08,250 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 11 [2024-11-19 11:15:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-11-19 11:15:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:15:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-11-19 11:15:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 11:15:08,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:08,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:08,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:15:08,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:08,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1750537448, now seen corresponding path program 1 times [2024-11-19 11:15:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403971148] [2024-11-19 11:15:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:15:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403971148] [2024-11-19 11:15:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403971148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465909610] [2024-11-19 11:15:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:08,391 INFO L87 Difference]: Start difference. First operand 206 states and 317 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:08,504 INFO L93 Difference]: Finished difference Result 435 states and 679 transitions. [2024-11-19 11:15:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-19 11:15:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:08,507 INFO L225 Difference]: With dead ends: 435 [2024-11-19 11:15:08,507 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 11:15:08,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:08,512 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 19 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:08,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 874 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 11:15:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2024-11-19 11:15:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 179 states have (on average 1.541899441340782) internal successors, (276), 190 states have internal predecessors, (276), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 11:15:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2024-11-19 11:15:08,533 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 16 [2024-11-19 11:15:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:08,533 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2024-11-19 11:15:08,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 11:15:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2024-11-19 11:15:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 11:15:08,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:08,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:15:08,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1874375666, now seen corresponding path program 1 times [2024-11-19 11:15:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527782527] [2024-11-19 11:15:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 11:15:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527782527] [2024-11-19 11:15:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527782527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794493716] [2024-11-19 11:15:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:08,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:08,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 11:15:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:08,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 11:15:08,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794493716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-19 11:15:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610953325] [2024-11-19 11:15:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:08,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:08,938 INFO L87 Difference]: Start difference. First operand 237 states and 362 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:08,981 INFO L93 Difference]: Finished difference Result 241 states and 368 transitions. [2024-11-19 11:15:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-19 11:15:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:08,984 INFO L225 Difference]: With dead ends: 241 [2024-11-19 11:15:08,984 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 11:15:08,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:08,985 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 19 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:08,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 836 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 11:15:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2024-11-19 11:15:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 179 states have (on average 1.5251396648044693) internal successors, (273), 189 states have internal predecessors, (273), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 11:15:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 359 transitions. [2024-11-19 11:15:09,013 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 359 transitions. Word has length 29 [2024-11-19 11:15:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:09,014 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 359 transitions. [2024-11-19 11:15:09,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 359 transitions. [2024-11-19 11:15:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 11:15:09,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:09,016 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:09,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 11:15:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:09,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2023897026, now seen corresponding path program 1 times [2024-11-19 11:15:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177454045] [2024-11-19 11:15:09,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 11:15:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177454045] [2024-11-19 11:15:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177454045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253666819] [2024-11-19 11:15:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:09,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:09,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:09,290 INFO L87 Difference]: Start difference. First operand 236 states and 359 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:09,317 INFO L93 Difference]: Finished difference Result 240 states and 365 transitions. [2024-11-19 11:15:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-19 11:15:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:09,320 INFO L225 Difference]: With dead ends: 240 [2024-11-19 11:15:09,322 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 11:15:09,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:09,323 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 18 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:09,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 838 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 11:15:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 206. [2024-11-19 11:15:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 164 states have internal predecessors, (237), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 11:15:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2024-11-19 11:15:09,344 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 30 [2024-11-19 11:15:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:09,344 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2024-11-19 11:15:09,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 11:15:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2024-11-19 11:15:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 11:15:09,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:09,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 11:15:09,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 205728696, now seen corresponding path program 1 times [2024-11-19 11:15:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307743866] [2024-11-19 11:15:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-19 11:15:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307743866] [2024-11-19 11:15:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307743866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144041991] [2024-11-19 11:15:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:09,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:09,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 11:15:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:09,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:09,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 11:15:09,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144041991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497206793] [2024-11-19 11:15:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:09,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:09,688 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:09,730 INFO L93 Difference]: Finished difference Result 359 states and 554 transitions. [2024-11-19 11:15:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2024-11-19 11:15:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:09,732 INFO L225 Difference]: With dead ends: 359 [2024-11-19 11:15:09,732 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 11:15:09,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:09,733 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:09,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 844 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 11:15:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-19 11:15:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.53125) internal successors, (245), 170 states have internal predecessors, (245), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 11:15:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 323 transitions. [2024-11-19 11:15:09,747 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 323 transitions. Word has length 92 [2024-11-19 11:15:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 323 transitions. [2024-11-19 11:15:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 323 transitions. [2024-11-19 11:15:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 11:15:09,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:09,750 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:09,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 11:15:09,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:09,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:09,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -527112528, now seen corresponding path program 1 times [2024-11-19 11:15:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38329711] [2024-11-19 11:15:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 11:15:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38329711] [2024-11-19 11:15:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38329711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394941] [2024-11-19 11:15:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:10,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:10,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 11:15:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:10,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 11:15:10,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273320291] [2024-11-19 11:15:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:10,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:10,335 INFO L87 Difference]: Start difference. First operand 213 states and 323 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:10,405 INFO L93 Difference]: Finished difference Result 373 states and 573 transitions. [2024-11-19 11:15:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-19 11:15:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:10,410 INFO L225 Difference]: With dead ends: 373 [2024-11-19 11:15:10,410 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 11:15:10,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:10,411 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 8 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:10,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 839 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 11:15:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-19 11:15:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 176 states have internal predecessors, (253), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 11:15:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 333 transitions. [2024-11-19 11:15:10,443 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 333 transitions. Word has length 94 [2024-11-19 11:15:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:10,447 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 333 transitions. [2024-11-19 11:15:10,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 333 transitions. [2024-11-19 11:15:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 11:15:10,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:10,450 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:10,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:10,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -747242443, now seen corresponding path program 1 times [2024-11-19 11:15:10,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:10,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131830888] [2024-11-19 11:15:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 11:15:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131830888] [2024-11-19 11:15:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131830888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929807989] [2024-11-19 11:15:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:10,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:10,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 11:15:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:10,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 11:15:10,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929807989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877481532] [2024-11-19 11:15:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:10,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:10,914 INFO L87 Difference]: Start difference. First operand 220 states and 333 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:10,995 INFO L93 Difference]: Finished difference Result 398 states and 623 transitions. [2024-11-19 11:15:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2024-11-19 11:15:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:10,997 INFO L225 Difference]: With dead ends: 398 [2024-11-19 11:15:10,997 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 11:15:10,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:10,999 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 39 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:10,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 800 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 11:15:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 11:15:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5480225988700564) internal successors, (274), 188 states have internal predecessors, (274), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 11:15:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 356 transitions. [2024-11-19 11:15:11,008 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 356 transitions. Word has length 95 [2024-11-19 11:15:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 356 transitions. [2024-11-19 11:15:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 356 transitions. [2024-11-19 11:15:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 11:15:11,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:11,015 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:11,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 11:15:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:11,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:11,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2094961184, now seen corresponding path program 1 times [2024-11-19 11:15:11,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450446587] [2024-11-19 11:15:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-19 11:15:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450446587] [2024-11-19 11:15:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450446587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537864493] [2024-11-19 11:15:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:11,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:11,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 11:15:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:11,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 11:15:11,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537864493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:11,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:11,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019603089] [2024-11-19 11:15:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:11,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:11,486 INFO L87 Difference]: Start difference. First operand 234 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:11,539 INFO L93 Difference]: Finished difference Result 473 states and 735 transitions. [2024-11-19 11:15:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:11,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-11-19 11:15:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:11,543 INFO L225 Difference]: With dead ends: 473 [2024-11-19 11:15:11,544 INFO L226 Difference]: Without dead ends: 258 [2024-11-19 11:15:11,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:11,545 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 21 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:11,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 820 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-19 11:15:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-19 11:15:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 197 states have (on average 1.5634517766497462) internal successors, (308), 208 states have internal predecessors, (308), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 11:15:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2024-11-19 11:15:11,556 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 98 [2024-11-19 11:15:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:11,556 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2024-11-19 11:15:11,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2024-11-19 11:15:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 11:15:11,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:11,558 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:11,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:11,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:11,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1724811394, now seen corresponding path program 1 times [2024-11-19 11:15:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216666353] [2024-11-19 11:15:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 11:15:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216666353] [2024-11-19 11:15:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216666353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919193541] [2024-11-19 11:15:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:11,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:11,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 11:15:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:11,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 11:15:12,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919193541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404778249] [2024-11-19 11:15:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:12,019 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:12,070 INFO L93 Difference]: Finished difference Result 517 states and 800 transitions. [2024-11-19 11:15:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-11-19 11:15:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:12,072 INFO L225 Difference]: With dead ends: 517 [2024-11-19 11:15:12,072 INFO L226 Difference]: Without dead ends: 278 [2024-11-19 11:15:12,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:12,073 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 19 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:12,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 807 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-19 11:15:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-19 11:15:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 213 states have (on average 1.568075117370892) internal successors, (334), 224 states have internal predecessors, (334), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 11:15:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 424 transitions. [2024-11-19 11:15:12,082 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 424 transitions. Word has length 100 [2024-11-19 11:15:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:12,082 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 424 transitions. [2024-11-19 11:15:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 424 transitions. [2024-11-19 11:15:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 11:15:12,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:12,084 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:12,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 11:15:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:12,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1043071740, now seen corresponding path program 1 times [2024-11-19 11:15:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405971120] [2024-11-19 11:15:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:15:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:12,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405971120] [2024-11-19 11:15:12,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405971120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928640756] [2024-11-19 11:15:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:12,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:12,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 11:15:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:12,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-19 11:15:12,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928640756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408954829] [2024-11-19 11:15:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:12,639 INFO L87 Difference]: Start difference. First operand 278 states and 424 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:12,665 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2024-11-19 11:15:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-19 11:15:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:12,667 INFO L225 Difference]: With dead ends: 286 [2024-11-19 11:15:12,667 INFO L226 Difference]: Without dead ends: 285 [2024-11-19 11:15:12,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:12,668 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 12 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:12,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 855 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-19 11:15:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 277. [2024-11-19 11:15:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 213 states have (on average 1.5633802816901408) internal successors, (333), 223 states have internal predecessors, (333), 45 states have call successors, (45), 14 states have call predecessors, (45), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 11:15:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 423 transitions. [2024-11-19 11:15:12,676 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 423 transitions. Word has length 101 [2024-11-19 11:15:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:12,677 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 423 transitions. [2024-11-19 11:15:12,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 423 transitions. [2024-11-19 11:15:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 11:15:12,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:12,678 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:12,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 11:15:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2024514750, now seen corresponding path program 1 times [2024-11-19 11:15:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025907223] [2024-11-19 11:15:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 11:15:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025907223] [2024-11-19 11:15:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025907223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126368159] [2024-11-19 11:15:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:12,986 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-11-19 11:15:12,987 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-11-19 11:15:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:13,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-19 11:15:13,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126368159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596060643] [2024-11-19 11:15:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:13,123 INFO L87 Difference]: Start difference. First operand 277 states and 423 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:13,149 INFO L93 Difference]: Finished difference Result 474 states and 728 transitions. [2024-11-19 11:15:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-11-19 11:15:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:13,152 INFO L225 Difference]: With dead ends: 474 [2024-11-19 11:15:13,152 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 11:15:13,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:13,153 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 11 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:13,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 834 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 11:15:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-19 11:15:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5585585585585586) internal successors, (346), 231 states have internal predecessors, (346), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 11:15:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 440 transitions. [2024-11-19 11:15:13,170 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 440 transitions. Word has length 102 [2024-11-19 11:15:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:13,170 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 440 transitions. [2024-11-19 11:15:13,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 11:15:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2024-11-19 11:15:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 11:15:13,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:13,176 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:13,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 11:15:13,376 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,SelfDestructingSolverStorable10 [2024-11-19 11:15:13,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:13,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash -377532014, now seen corresponding path program 1 times [2024-11-19 11:15:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:13,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090513820] [2024-11-19 11:15:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 11:15:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090513820] [2024-11-19 11:15:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090513820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132275424] [2024-11-19 11:15:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:13,490 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-11-19 11:15:13,501 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-11-19 11:15:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:13,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:15:13,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132275424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803324482] [2024-11-19 11:15:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:13,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:13,662 INFO L87 Difference]: Start difference. First operand 287 states and 440 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:13,692 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2024-11-19 11:15:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-19 11:15:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:13,694 INFO L225 Difference]: With dead ends: 298 [2024-11-19 11:15:13,695 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 11:15:13,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:13,695 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 10 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:13,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 830 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 11:15:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 288. [2024-11-19 11:15:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 232 states have internal predecessors, (347), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 11:15:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-19 11:15:13,705 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 109 [2024-11-19 11:15:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-19 11:15:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-19 11:15:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 11:15:13,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:13,707 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:13,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 11:15:13,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:13,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1181409788, now seen corresponding path program 1 times [2024-11-19 11:15:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:13,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440641792] [2024-11-19 11:15:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 11:15:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440641792] [2024-11-19 11:15:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440641792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868320975] [2024-11-19 11:15:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:14,014 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-11-19 11:15:14,015 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-11-19 11:15:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:14,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:15:14,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868320975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:14,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668798523] [2024-11-19 11:15:14,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:14,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:14,156 INFO L87 Difference]: Start difference. First operand 288 states and 441 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:14,180 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2024-11-19 11:15:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-19 11:15:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:14,183 INFO L225 Difference]: With dead ends: 290 [2024-11-19 11:15:14,183 INFO L226 Difference]: Without dead ends: 289 [2024-11-19 11:15:14,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:14,183 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 9 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:14,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 832 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-19 11:15:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-19 11:15:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 233 states have internal predecessors, (348), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 11:15:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 442 transitions. [2024-11-19 11:15:14,193 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 442 transitions. Word has length 110 [2024-11-19 11:15:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 442 transitions. [2024-11-19 11:15:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 442 transitions. [2024-11-19 11:15:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 11:15:14,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:14,195 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:14,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 11:15:14,396 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,SelfDestructingSolverStorable12 [2024-11-19 11:15:14,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:14,398 INFO L85 PathProgramCache]: Analyzing trace with hash -966294506, now seen corresponding path program 1 times [2024-11-19 11:15:14,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:14,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812511565] [2024-11-19 11:15:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 11:15:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812511565] [2024-11-19 11:15:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812511565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514911204] [2024-11-19 11:15:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:14,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:14,516 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-11-19 11:15:14,521 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-11-19 11:15:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:14,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:15:14,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514911204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769511804] [2024-11-19 11:15:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:14,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:14,715 INFO L87 Difference]: Start difference. First operand 289 states and 442 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:14,758 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2024-11-19 11:15:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-11-19 11:15:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:14,761 INFO L225 Difference]: With dead ends: 294 [2024-11-19 11:15:14,761 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 11:15:14,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:14,762 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:14,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1087 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 11:15:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2024-11-19 11:15:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5491071428571428) internal successors, (347), 232 states have internal predecessors, (347), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 11:15:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 441 transitions. [2024-11-19 11:15:14,773 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 441 transitions. Word has length 111 [2024-11-19 11:15:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:14,774 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 441 transitions. [2024-11-19 11:15:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:15:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 441 transitions. [2024-11-19 11:15:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 11:15:14,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:14,776 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:14,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:14,977 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,SelfDestructingSolverStorable13 [2024-11-19 11:15:14,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:14,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 109641720, now seen corresponding path program 1 times [2024-11-19 11:15:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951503842] [2024-11-19 11:15:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 11:15:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951503842] [2024-11-19 11:15:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951503842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165290243] [2024-11-19 11:15:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:15,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:15,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 11:15:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:15,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:15:15,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165290243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697842726] [2024-11-19 11:15:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:15,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:15,274 INFO L87 Difference]: Start difference. First operand 288 states and 441 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 11:15:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:15,319 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2024-11-19 11:15:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-19 11:15:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:15,322 INFO L225 Difference]: With dead ends: 493 [2024-11-19 11:15:15,322 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 11:15:15,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:15,324 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 20 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:15,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1372 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 11:15:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2024-11-19 11:15:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 234 states have internal predecessors, (353), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 449 transitions. [2024-11-19 11:15:15,354 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 449 transitions. Word has length 112 [2024-11-19 11:15:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:15,354 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 449 transitions. [2024-11-19 11:15:15,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 11:15:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 449 transitions. [2024-11-19 11:15:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 11:15:15,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:15,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:15,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 11:15:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 11:15:15,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 501283168, now seen corresponding path program 1 times [2024-11-19 11:15:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835866274] [2024-11-19 11:15:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:15,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835866274] [2024-11-19 11:15:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835866274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023162516] [2024-11-19 11:15:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:15,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:15,677 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:15,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 11:15:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:15,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:15,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:15,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023162516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:15,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:15,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:15,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843969976] [2024-11-19 11:15:15,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:15,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:15,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:15,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:15,860 INFO L87 Difference]: Start difference. First operand 291 states and 449 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:15,898 INFO L93 Difference]: Finished difference Result 300 states and 464 transitions. [2024-11-19 11:15:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:15,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-11-19 11:15:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:15,901 INFO L225 Difference]: With dead ends: 300 [2024-11-19 11:15:15,901 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 11:15:15,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:15,902 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 8 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:15,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 863 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 11:15:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2024-11-19 11:15:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.5526315789473684) internal successors, (354), 235 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-19 11:15:15,915 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 117 [2024-11-19 11:15:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-19 11:15:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-19 11:15:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 11:15:15,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:15,918 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:15,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 11:15:16,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 11:15:16,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1640090630, now seen corresponding path program 1 times [2024-11-19 11:15:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357706289] [2024-11-19 11:15:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357706289] [2024-11-19 11:15:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357706289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348025514] [2024-11-19 11:15:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:16,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:16,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:16,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 11:15:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:16,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:16,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:16,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348025514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:16,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209855870] [2024-11-19 11:15:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:16,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:16,512 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:16,551 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2024-11-19 11:15:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-19 11:15:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:16,553 INFO L225 Difference]: With dead ends: 295 [2024-11-19 11:15:16,553 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 11:15:16,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:16,554 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 7 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:16,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 852 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 11:15:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2024-11-19 11:15:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.5502183406113537) internal successors, (355), 236 states have internal predecessors, (355), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-11-19 11:15:16,561 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 118 [2024-11-19 11:15:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-11-19 11:15:16,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-11-19 11:15:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 11:15:16,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:16,566 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:16,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 11:15:16,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:16,767 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1673553892, now seen corresponding path program 1 times [2024-11-19 11:15:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:16,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094565153] [2024-11-19 11:15:16,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094565153] [2024-11-19 11:15:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094565153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097942154] [2024-11-19 11:15:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:16,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:16,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 11:15:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:17,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:17,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097942154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420518381] [2024-11-19 11:15:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:17,032 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:17,067 INFO L93 Difference]: Finished difference Result 301 states and 465 transitions. [2024-11-19 11:15:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-19 11:15:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:17,069 INFO L225 Difference]: With dead ends: 301 [2024-11-19 11:15:17,070 INFO L226 Difference]: Without dead ends: 300 [2024-11-19 11:15:17,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:17,070 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:17,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1088 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-19 11:15:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-11-19 11:15:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 230 states have (on average 1.5478260869565217) internal successors, (356), 237 states have internal predecessors, (356), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-19 11:15:17,079 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 119 [2024-11-19 11:15:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:17,079 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-19 11:15:17,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-19 11:15:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 11:15:17,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:17,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:17,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-19 11:15:17,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 11:15:17,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -774880796, now seen corresponding path program 1 times [2024-11-19 11:15:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526523959] [2024-11-19 11:15:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:17,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526523959] [2024-11-19 11:15:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526523959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746318682] [2024-11-19 11:15:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:17,383 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:17,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 11:15:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:17,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:17,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746318682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906867369] [2024-11-19 11:15:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:17,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:17,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:17,583 INFO L87 Difference]: Start difference. First operand 294 states and 452 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:17,626 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2024-11-19 11:15:17,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:17,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-19 11:15:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:17,628 INFO L225 Difference]: With dead ends: 302 [2024-11-19 11:15:17,628 INFO L226 Difference]: Without dead ends: 301 [2024-11-19 11:15:17,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:17,629 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 12 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:17,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1149 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-19 11:15:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2024-11-19 11:15:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-19 11:15:17,640 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 119 [2024-11-19 11:15:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:17,641 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-19 11:15:17,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:15:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-19 11:15:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 11:15:17,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:17,643 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:17,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:17,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 340563446, now seen corresponding path program 1 times [2024-11-19 11:15:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879990660] [2024-11-19 11:15:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879990660] [2024-11-19 11:15:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879990660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640523286] [2024-11-19 11:15:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:17,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:17,939 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:17,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 11:15:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:18,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:18,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:18,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640523286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277093970] [2024-11-19 11:15:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:18,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:18,120 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:15:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:18,180 INFO L93 Difference]: Finished difference Result 297 states and 456 transitions. [2024-11-19 11:15:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-19 11:15:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:18,183 INFO L225 Difference]: With dead ends: 297 [2024-11-19 11:15:18,183 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 11:15:18,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:18,184 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 18 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:18,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1448 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 11:15:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-19 11:15:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 235 states have internal predecessors, (354), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2024-11-19 11:15:18,198 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 120 [2024-11-19 11:15:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:18,198 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2024-11-19 11:15:18,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:15:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2024-11-19 11:15:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 11:15:18,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:18,200 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:18,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 11:15:18,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:18,405 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1748499446, now seen corresponding path program 1 times [2024-11-19 11:15:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659082317] [2024-11-19 11:15:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659082317] [2024-11-19 11:15:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659082317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943789367] [2024-11-19 11:15:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:18,481 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:18,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 11:15:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:18,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:18,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943789367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:18,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:18,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980746224] [2024-11-19 11:15:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:18,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:18,708 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:15:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:18,752 INFO L93 Difference]: Finished difference Result 509 states and 785 transitions. [2024-11-19 11:15:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-19 11:15:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:18,755 INFO L225 Difference]: With dead ends: 509 [2024-11-19 11:15:18,755 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 11:15:18,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:18,756 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 24 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:18,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1122 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 11:15:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2024-11-19 11:15:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 237 states have internal predecessors, (356), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 11:15:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 452 transitions. [2024-11-19 11:15:18,766 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 452 transitions. Word has length 120 [2024-11-19 11:15:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:18,766 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 452 transitions. [2024-11-19 11:15:18,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:15:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 452 transitions. [2024-11-19 11:15:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 11:15:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:18,768 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:18,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:18,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:18,969 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:15:18,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1808412942, now seen corresponding path program 1 times [2024-11-19 11:15:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978631798] [2024-11-19 11:15:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 11:15:19,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978631798] [2024-11-19 11:15:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978631798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629593762] [2024-11-19 11:15:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:19,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:19,049 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 11:15:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:19,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 11:15:19,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 11:15:19,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629593762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:19,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-19 11:15:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342435392] [2024-11-19 11:15:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:19,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 11:15:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 11:15:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:19,248 INFO L87 Difference]: Start difference. First operand 294 states and 452 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 11:15:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:19,308 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2024-11-19 11:15:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:15:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 122 [2024-11-19 11:15:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:19,310 INFO L225 Difference]: With dead ends: 308 [2024-11-19 11:15:19,310 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 11:15:19,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:19,311 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 36 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:19,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1668 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 11:15:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 11:15:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:15:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 11:15:19,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-19 11:15:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:19,312 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 11:15:19,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 11:15:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 11:15:19,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 11:15:19,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 11:15:19,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 11:15:19,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 11:15:19,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 11:15:19,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 11:15:19,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 11:15:19,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 11:15:19,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 11:15:19,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:19,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:19,520 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:19,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 11:15:19,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:15:19,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:15:19 BoogieIcfgContainer [2024-11-19 11:15:19,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:15:19,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:15:19,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:15:19,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:15:19,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:07" (3/4) ... [2024-11-19 11:15:19,805 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 11:15:19,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-19 11:15:19,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-19 11:15:19,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-19 11:15:19,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-19 11:15:19,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 11:15:19,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-19 11:15:19,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-19 11:15:19,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-19 11:15:19,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 11:15:19,820 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 11:15:19,844 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-19 11:15:19,879 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-11-19 11:15:19,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 11:15:19,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 11:15:19,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:15:19,928 INFO L158 Benchmark]: Toolchain (without parser) took 13650.64ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 99.4MB in the beginning and 125.2MB in the end (delta: -25.7MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,928 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:19,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.88ms. Allocated memory is still 155.2MB. Free memory was 99.4MB in the beginning and 80.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 77.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,928 INFO L158 Benchmark]: Boogie Preprocessor took 56.03ms. Allocated memory is still 155.2MB. Free memory was 76.8MB in the beginning and 72.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,929 INFO L158 Benchmark]: RCFGBuilder took 889.80ms. Allocated memory is still 155.2MB. Free memory was 72.9MB in the beginning and 113.5MB in the end (delta: -40.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,929 INFO L158 Benchmark]: TraceAbstraction took 12114.04ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 112.7MB in the beginning and 137.7MB in the end (delta: -25.1MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,929 INFO L158 Benchmark]: Witness Printer took 125.07ms. Allocated memory is still 325.1MB. Free memory was 137.7MB in the beginning and 125.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,930 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.88ms. Allocated memory is still 155.2MB. Free memory was 99.4MB in the beginning and 80.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 77.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.03ms. Allocated memory is still 155.2MB. Free memory was 76.8MB in the beginning and 72.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 889.80ms. Allocated memory is still 155.2MB. Free memory was 72.9MB in the beginning and 113.5MB in the end (delta: -40.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12114.04ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 112.7MB in the beginning and 137.7MB in the end (delta: -25.1MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. * Witness Printer took 125.07ms. Allocated memory is still 325.1MB. Free memory was 137.7MB in the beginning and 125.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 277]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 281]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: 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 7 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 21532 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15238 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 980 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 6294 mSDtfsCounter, 980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2103 GetRequests, 1963 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=18, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 118 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4033 NumberOfCodeBlocks, 4033 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 4612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10641 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 1814/1875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 104]: Procedure Contract for read_history_int8 Derived contract for procedure read_history_int8. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 124]: Procedure Contract for read_history_bool Derived contract for procedure read_history_bool. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 534]: Procedure Contract for assert Derived contract for procedure assert. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 60]: Procedure Contract for add_history_type Derived contract for procedure add_history_type. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 36]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (gate1Failed_History_0 == \old(gate1Failed_History_0))) && (gate1Failed_History_1 == \old(gate1Failed_History_1))) && (gate1Failed_History_2 == \old(gate1Failed_History_2))) && (gate2Failed_History_0 == \old(gate2Failed_History_0))) && (gate2Failed_History_1 == \old(gate2Failed_History_1))) && (gate2Failed_History_2 == \old(gate2Failed_History_2))) && (gate3Failed_History_0 == \old(gate3Failed_History_0))) && (gate3Failed_History_1 == \old(gate3Failed_History_1))) && (gate3Failed_History_2 == \old(gate3Failed_History_2))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) - ProcedureContractResult [Line: 179]: Procedure Contract for write_history_bool Derived contract for procedure write_history_bool. Ensures: (((((((((((((((((((nomsg == \old(nomsg)) && (g1v == \old(g1v))) && (g1v_old == \old(g1v_old))) && (g1v_new == \old(g1v_new))) && (g2v == \old(g2v))) && (g2v_old == \old(g2v_old))) && (g2v_new == \old(g2v_new))) && (g3v == \old(g3v))) && (g3v_old == \old(g3v_old))) && (g3v_new == \old(g3v_new))) && (gate1Failed == \old(gate1Failed))) && (gate2Failed == \old(gate2Failed))) && (gate3Failed == \old(gate3Failed))) && (VALUE1 == \old(VALUE1))) && (VALUE2 == \old(VALUE2))) && (VALUE3 == \old(VALUE3))) && (votedValue_History_0 == \old(votedValue_History_0))) && (votedValue_History_1 == \old(votedValue_History_1))) && (votedValue_History_2 == \old(votedValue_History_2))) RESULT: Ultimate proved your program to be correct! [2024-11-19 11:15:19,965 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