./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.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.2.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 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:15:02,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:15:02,250 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:02,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:15:02,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:15:02,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:15:02,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:15:02,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:15:02,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:15:02,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:15:02,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:15:02,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:15:02,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:15:02,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:15:02,294 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:15:02,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:15:02,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:15:02,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:15:02,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:15:02,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:15:02,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:15:02,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:15:02,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:15:02,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:15:02,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:15:02,297 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:15:02,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:15:02,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:15:02,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:15:02,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:15:02,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:15:02,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:15:02,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:15:02,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:15:02,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:02,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:15:02,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:15:02,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:15:02,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:15:02,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:15:02,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:15:02,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:15:02,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:15:02,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:15:02,306 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 -> 5c227f1dec7d604552aae19de1afcc1049837e83568477af6195219b22e2f636 [2024-11-19 11:15:02,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:15:02,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:15:02,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:15:02,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:15:02,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:15:02,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:04,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:15:04,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:15:04,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:04,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef994f10d/f2c1ee7cebea4fdebc81187065f029ec/FLAGc472e0d9d [2024-11-19 11:15:04,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef994f10d/f2c1ee7cebea4fdebc81187065f029ec [2024-11-19 11:15:04,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:15:04,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:15:04,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:04,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:15:04,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:15:04,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:04" (1/1) ... [2024-11-19 11:15:04,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7264aecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:04, skipping insertion in model container [2024-11-19 11:15:04,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:15:04" (1/1) ... [2024-11-19 11:15:04,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:15:04,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:04,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:15:04,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:15:04,804 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:15:04,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:04 WrapperNode [2024-11-19 11:15:04,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:15:04,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:04,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:15:04,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:15:04,813 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:04" (1/1) ... [2024-11-19 11:15:04,828 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:04" (1/1) ... [2024-11-19 11:15:04,880 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2024-11-19 11:15:04,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:15:04,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:15:04,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:15:04,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:15:04,896 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:04" (1/1) ... [2024-11-19 11:15:04,896 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:04" (1/1) ... [2024-11-19 11:15:04,904 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:04" (1/1) ... [2024-11-19 11:15:04,936 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:04,937 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:04" (1/1) ... [2024-11-19 11:15:04,940 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:04" (1/1) ... [2024-11-19 11:15:04,951 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:04" (1/1) ... [2024-11-19 11:15:04,963 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:04" (1/1) ... [2024-11-19 11:15:04,965 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:04" (1/1) ... [2024-11-19 11:15:04,967 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:04" (1/1) ... [2024-11-19 11:15:04,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:15:04,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:15:04,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:15:04,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:15:04,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:04" (1/1) ... [2024-11-19 11:15:04,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:15:05,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:05,020 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:05,023 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:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:15:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-19 11:15:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-19 11:15:05,073 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-19 11:15:05,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-19 11:15:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-19 11:15:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-19 11:15:05,074 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-19 11:15:05,074 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-19 11:15:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-19 11:15:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-19 11:15:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 11:15:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 11:15:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:15:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:15:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:15:05,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:15:05,200 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:15:05,854 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-19 11:15:05,854 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:15:05,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:15:05,880 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 11:15:05,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:05 BoogieIcfgContainer [2024-11-19 11:15:05,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:15:05,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:15:05,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:15:05,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:15:05,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:15:04" (1/3) ... [2024-11-19 11:15:05,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e30da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:05, skipping insertion in model container [2024-11-19 11:15:05,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:15:04" (2/3) ... [2024-11-19 11:15:05,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e30da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:15:05, skipping insertion in model container [2024-11-19 11:15:05,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:15:05" (3/3) ... [2024-11-19 11:15:05,890 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-11-19 11:15:05,904 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:15:05,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 11:15:05,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:15:05,990 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;@3e5ee272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:15:05,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 11:15:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 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:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 11:15:06,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:06,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:15:06,005 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:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -324035863, now seen corresponding path program 1 times [2024-11-19 11:15:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:06,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415618969] [2024-11-19 11:15:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:06,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:06,376 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:06,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415618969] [2024-11-19 11:15:06,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415618969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:06,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:15:06,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437253706] [2024-11-19 11:15:06,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:06,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:06,407 INFO L87 Difference]: Start difference. First operand has 193 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 153 states have internal predecessors, (225), 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:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:06,535 INFO L93 Difference]: Finished difference Result 402 states and 661 transitions. [2024-11-19 11:15:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:06,541 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:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:06,554 INFO L225 Difference]: With dead ends: 402 [2024-11-19 11:15:06,554 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 11:15:06,560 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:06,563 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 37 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 862 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:06,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 862 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:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 11:15:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2024-11-19 11:15:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.5695364238410596) internal successors, (237), 162 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:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2024-11-19 11:15:06,623 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 11 [2024-11-19 11:15:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:06,623 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2024-11-19 11:15:06,624 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:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2024-11-19 11:15:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 11:15:06,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:06,626 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:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:15:06,627 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:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 972050568, now seen corresponding path program 1 times [2024-11-19 11:15:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:06,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476233020] [2024-11-19 11:15:06,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:06,832 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:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476233020] [2024-11-19 11:15:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476233020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537331786] [2024-11-19 11:15:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:06,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:06,839 INFO L87 Difference]: Start difference. First operand 204 states and 313 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:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:06,922 INFO L93 Difference]: Finished difference Result 431 states and 671 transitions. [2024-11-19 11:15:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:06,927 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:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:06,930 INFO L225 Difference]: With dead ends: 431 [2024-11-19 11:15:06,931 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 11:15:06,932 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:06,934 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 19 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 854 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:06,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 854 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:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 11:15:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2024-11-19 11:15:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 177 states have (on average 1.536723163841808) internal successors, (272), 188 states have internal predecessors, (272), 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:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 358 transitions. [2024-11-19 11:15:06,962 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 358 transitions. Word has length 16 [2024-11-19 11:15:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 358 transitions. [2024-11-19 11:15:06,963 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:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-11-19 11:15:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 11:15:06,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:06,965 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:06,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:15:06,966 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:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1383802397, now seen corresponding path program 1 times [2024-11-19 11:15:06,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:06,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958371309] [2024-11-19 11:15:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:07,175 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:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958371309] [2024-11-19 11:15:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958371309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432464037] [2024-11-19 11:15:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:07,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:07,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:07,180 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:07,181 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:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:07,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:07,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:07,405 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:07,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432464037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-19 11:15:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152884412] [2024-11-19 11:15:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:07,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:07,407 INFO L87 Difference]: Start difference. First operand 235 states and 358 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:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:07,468 INFO L93 Difference]: Finished difference Result 239 states and 364 transitions. [2024-11-19 11:15:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:07,469 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:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:07,471 INFO L225 Difference]: With dead ends: 239 [2024-11-19 11:15:07,472 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 11:15:07,472 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:07,475 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 19 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:07,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 11:15:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-19 11:15:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 187 states have internal predecessors, (269), 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:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2024-11-19 11:15:07,513 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 29 [2024-11-19 11:15:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2024-11-19 11:15:07,517 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:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2024-11-19 11:15:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 11:15:07,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:07,519 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:07,540 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:07,720 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:07,720 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:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash 51799170, now seen corresponding path program 1 times [2024-11-19 11:15:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586145979] [2024-11-19 11:15:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:07,821 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:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586145979] [2024-11-19 11:15:07,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586145979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:07,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:15:07,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:15:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589746127] [2024-11-19 11:15:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:15:07,826 INFO L87 Difference]: Start difference. First operand 234 states and 355 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:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:07,861 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2024-11-19 11:15:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:07,862 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:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:07,867 INFO L225 Difference]: With dead ends: 238 [2024-11-19 11:15:07,867 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 11:15:07,869 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:07,870 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 18 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 826 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:07,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 826 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:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 11:15:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2024-11-19 11:15:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.522875816993464) internal successors, (233), 162 states have internal predecessors, (233), 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:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 309 transitions. [2024-11-19 11:15:07,897 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 309 transitions. Word has length 30 [2024-11-19 11:15:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:07,898 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 309 transitions. [2024-11-19 11:15:07,898 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:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 309 transitions. [2024-11-19 11:15:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 11:15:07,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:07,904 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:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 11:15:07,904 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:07,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1290767981, now seen corresponding path program 1 times [2024-11-19 11:15:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784569139] [2024-11-19 11:15:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,127 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:08,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784569139] [2024-11-19 11:15:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784569139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935046910] [2024-11-19 11:15:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:08,131 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:08,133 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:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:08,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:08,343 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:08,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935046910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543501530] [2024-11-19 11:15:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:08,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:08,348 INFO L87 Difference]: Start difference. First operand 204 states and 309 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:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:08,411 INFO L93 Difference]: Finished difference Result 355 states and 546 transitions. [2024-11-19 11:15:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:08,413 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:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:08,415 INFO L225 Difference]: With dead ends: 355 [2024-11-19 11:15:08,415 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 11:15:08,416 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:08,416 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 10 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 832 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:08,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 832 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:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 11:15:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-19 11:15:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 158 states have (on average 1.5253164556962024) internal successors, (241), 168 states have internal predecessors, (241), 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:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 319 transitions. [2024-11-19 11:15:08,432 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 319 transitions. Word has length 92 [2024-11-19 11:15:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:08,432 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 319 transitions. [2024-11-19 11:15:08,433 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:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 319 transitions. [2024-11-19 11:15:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 11:15:08,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:08,436 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:08,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:08,640 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:08,641 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:08,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash -587374587, now seen corresponding path program 1 times [2024-11-19 11:15:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543294260] [2024-11-19 11:15:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,802 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:08,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:08,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543294260] [2024-11-19 11:15:08,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543294260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:08,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261893482] [2024-11-19 11:15:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:08,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:08,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:08,805 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:08,806 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:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:08,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:08,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:09,038 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:09,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261893482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:09,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650571854] [2024-11-19 11:15:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:09,058 INFO L87 Difference]: Start difference. First operand 211 states and 319 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,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:09,117 INFO L93 Difference]: Finished difference Result 369 states and 565 transitions. [2024-11-19 11:15:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:09,117 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:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:09,119 INFO L225 Difference]: With dead ends: 369 [2024-11-19 11:15:09,119 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 11:15:09,120 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:09,121 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 8 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 829 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:09,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 829 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:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 11:15:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-19 11:15:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 174 states have internal predecessors, (249), 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:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 329 transitions. [2024-11-19 11:15:09,139 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 329 transitions. Word has length 94 [2024-11-19 11:15:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:09,139 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 329 transitions. [2024-11-19 11:15:09,139 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,140 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 329 transitions. [2024-11-19 11:15:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 11:15:09,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:09,143 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:09,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 11:15:09,346 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:09,347 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:09,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -315083275, now seen corresponding path program 1 times [2024-11-19 11:15:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276205026] [2024-11-19 11:15:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:09,497 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:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276205026] [2024-11-19 11:15:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276205026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710446461] [2024-11-19 11:15:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:09,500 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:09,502 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:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:09,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:09,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:09,685 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:09,685 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 [710446461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818807987] [2024-11-19 11:15:09,686 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,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:09,687 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 218 states and 329 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:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:09,800 INFO L93 Difference]: Finished difference Result 394 states and 615 transitions. [2024-11-19 11:15:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:09,801 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:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:09,803 INFO L225 Difference]: With dead ends: 394 [2024-11-19 11:15:09,803 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 11:15:09,804 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:09,805 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 39 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 788 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:09,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 788 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:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 11:15:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-19 11:15:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.542857142857143) internal successors, (270), 186 states have internal predecessors, (270), 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:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 352 transitions. [2024-11-19 11:15:09,817 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 352 transitions. Word has length 95 [2024-11-19 11:15:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:09,818 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 352 transitions. [2024-11-19 11:15:09,818 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:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 352 transitions. [2024-11-19 11:15:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 11:15:09,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:09,820 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:09,838 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:10,021 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:10,021 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:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 316307424, now seen corresponding path program 1 times [2024-11-19 11:15:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062279324] [2024-11-19 11:15:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,175 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:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:10,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062279324] [2024-11-19 11:15:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062279324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:10,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825058023] [2024-11-19 11:15:10,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:10,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:10,180 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:10,182 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:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:10,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:10,368 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:10,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825058023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:10,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018502454] [2024-11-19 11:15:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:10,373 INFO L87 Difference]: Start difference. First operand 232 states and 352 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:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:10,442 INFO L93 Difference]: Finished difference Result 469 states and 727 transitions. [2024-11-19 11:15:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:10,442 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:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:10,445 INFO L225 Difference]: With dead ends: 469 [2024-11-19 11:15:10,447 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 11:15:10,448 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:10,449 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 21 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 808 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:10,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 808 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:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 11:15:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-19 11:15:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 195 states have (on average 1.558974358974359) internal successors, (304), 206 states have internal predecessors, (304), 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:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2024-11-19 11:15:10,466 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 98 [2024-11-19 11:15:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2024-11-19 11:15:10,467 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:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2024-11-19 11:15:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 11:15:10,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:10,470 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:10,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 11:15:10,671 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:10,671 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:10,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash 587919294, now seen corresponding path program 1 times [2024-11-19 11:15:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439149201] [2024-11-19 11:15:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,789 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:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439149201] [2024-11-19 11:15:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439149201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550152339] [2024-11-19 11:15:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:10,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:15:10,794 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:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:10,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:10,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:11,002 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:11,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550152339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:11,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:11,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 11:15:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718557782] [2024-11-19 11:15:11,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:11,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:11,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:11,005 INFO L87 Difference]: Start difference. First operand 256 states and 390 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,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:11,090 INFO L93 Difference]: Finished difference Result 513 states and 792 transitions. [2024-11-19 11:15:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:11,091 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:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:11,093 INFO L225 Difference]: With dead ends: 513 [2024-11-19 11:15:11,094 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 11:15:11,095 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:11,096 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 19 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 795 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:11,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 795 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 11:15:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-19 11:15:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 211 states have (on average 1.5639810426540284) internal successors, (330), 222 states have internal predecessors, (330), 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:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 420 transitions. [2024-11-19 11:15:11,112 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 420 transitions. Word has length 100 [2024-11-19 11:15:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:11,113 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 420 transitions. [2024-11-19 11:15:11,113 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,113 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 420 transitions. [2024-11-19 11:15:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 11:15:11,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:11,115 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:11,133 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:11,316 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:11,316 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:11,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1416958404, now seen corresponding path program 1 times [2024-11-19 11:15:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839507475] [2024-11-19 11:15:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,476 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:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839507475] [2024-11-19 11:15:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839507475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994901989] [2024-11-19 11:15:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:11,479 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:11,480 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:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:11,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:11,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:11,653 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:11,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994901989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:11,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259390480] [2024-11-19 11:15:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:11,655 INFO L87 Difference]: Start difference. First operand 276 states and 420 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:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:11,689 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2024-11-19 11:15:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:11,689 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:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:11,691 INFO L225 Difference]: With dead ends: 284 [2024-11-19 11:15:11,691 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 11:15:11,692 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:11,692 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 12 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:11,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 815 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 11:15:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-11-19 11:15:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 221 states have internal predecessors, (329), 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:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 419 transitions. [2024-11-19 11:15:11,705 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 419 transitions. Word has length 101 [2024-11-19 11:15:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:11,706 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 419 transitions. [2024-11-19 11:15:11,706 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:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 419 transitions. [2024-11-19 11:15:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 11:15:11,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:11,708 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:11,726 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:11,908 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:11,910 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:11,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 976037875, now seen corresponding path program 1 times [2024-11-19 11:15:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746547330] [2024-11-19 11:15:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,020 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,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746547330] [2024-11-19 11:15:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746547330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011226279] [2024-11-19 11:15:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:12,023 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,024 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:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:12,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:12,223 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,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011226279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358882506] [2024-11-19 11:15:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:12,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:12,226 INFO L87 Difference]: Start difference. First operand 275 states and 419 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:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:12,266 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2024-11-19 11:15:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:12,267 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:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:12,270 INFO L225 Difference]: With dead ends: 470 [2024-11-19 11:15:12,270 INFO L226 Difference]: Without dead ends: 285 [2024-11-19 11:15:12,271 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:12,271 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 11 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:12,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 857 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-19 11:15:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-19 11:15:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 229 states have internal predecessors, (342), 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:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2024-11-19 11:15:12,285 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 102 [2024-11-19 11:15:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:12,285 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2024-11-19 11:15:12,285 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:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2024-11-19 11:15:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 11:15:12,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:12,287 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:12,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:12,488 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:12,488 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:12,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -686130286, now seen corresponding path program 1 times [2024-11-19 11:15:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824867020] [2024-11-19 11:15:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,616 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:12,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824867020] [2024-11-19 11:15:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824867020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457962981] [2024-11-19 11:15:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:12,619 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:12,620 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:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:12,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:12,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:12,820 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:12,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457962981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:12,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517394094] [2024-11-19 11:15:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:12,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:12,823 INFO L87 Difference]: Start difference. First operand 285 states and 436 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:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:12,869 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2024-11-19 11:15:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:12,869 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:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:12,872 INFO L225 Difference]: With dead ends: 296 [2024-11-19 11:15:12,872 INFO L226 Difference]: Without dead ends: 295 [2024-11-19 11:15:12,872 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:12,873 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 10 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 857 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:12,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 857 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:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-19 11:15:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 286. [2024-11-19 11:15:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.5520361990950227) internal successors, (343), 230 states have internal predecessors, (343), 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:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-19 11:15:12,887 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 109 [2024-11-19 11:15:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:12,887 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-19 11:15:12,888 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:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-19 11:15:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 11:15:12,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:12,890 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:12,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:13,094 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,095 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,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 204797937, now seen corresponding path program 1 times [2024-11-19 11:15:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076947052] [2024-11-19 11:15:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,222 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,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076947052] [2024-11-19 11:15:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076947052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332807435] [2024-11-19 11:15:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:13,225 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:13,228 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:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:13,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:13,439 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,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:13,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332807435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:13,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229094014] [2024-11-19 11:15:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:13,441 INFO L87 Difference]: Start difference. First operand 286 states and 437 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:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:13,475 INFO L93 Difference]: Finished difference Result 288 states and 439 transitions. [2024-11-19 11:15:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:13,476 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:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:13,478 INFO L225 Difference]: With dead ends: 288 [2024-11-19 11:15:13,478 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 11:15:13,479 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:13,480 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 9 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:13,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 833 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 11:15:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-19 11:15:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.5495495495495495) internal successors, (344), 231 states have internal predecessors, (344), 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,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 438 transitions. [2024-11-19 11:15:13,492 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 438 transitions. Word has length 110 [2024-11-19 11:15:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:13,493 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 438 transitions. [2024-11-19 11:15:13,493 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:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 438 transitions. [2024-11-19 11:15:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 11:15:13,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:13,495 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:13,513 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:13,696 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:13,696 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:13,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash -282600266, now seen corresponding path program 1 times [2024-11-19 11:15:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:13,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54793100] [2024-11-19 11:15:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,813 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,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54793100] [2024-11-19 11:15:13,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54793100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984396864] [2024-11-19 11:15:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:13,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:13,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:13,817 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:13,818 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:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:13,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:13,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:14,021 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,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984396864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:14,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:14,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460954572] [2024-11-19 11:15:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:14,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:14,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:14,023 INFO L87 Difference]: Start difference. First operand 287 states and 438 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,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:14,070 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2024-11-19 11:15:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:14,071 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,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:14,073 INFO L225 Difference]: With dead ends: 292 [2024-11-19 11:15:14,073 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 11:15:14,073 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,074 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 12 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1071 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,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1071 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 11:15:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-11-19 11:15:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.545045045045045) internal successors, (343), 230 states have internal predecessors, (343), 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,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 437 transitions. [2024-11-19 11:15:14,085 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 437 transitions. Word has length 111 [2024-11-19 11:15:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 437 transitions. [2024-11-19 11:15:14,085 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,086 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 437 transitions. [2024-11-19 11:15:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 11:15:14,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:14,087 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,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 11:15:14,288 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,288 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,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -170673331, now seen corresponding path program 1 times [2024-11-19 11:15:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798071813] [2024-11-19 11:15:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,421 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,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:14,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798071813] [2024-11-19 11:15:14,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798071813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:14,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464236999] [2024-11-19 11:15:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:14,424 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:14,426 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:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:14,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:14,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:14,636 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,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464236999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:14,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:14,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559414654] [2024-11-19 11:15:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:14,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:14,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:14,640 INFO L87 Difference]: Start difference. First operand 286 states and 437 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:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:14,696 INFO L93 Difference]: Finished difference Result 489 states and 751 transitions. [2024-11-19 11:15:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:14,696 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:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:14,699 INFO L225 Difference]: With dead ends: 489 [2024-11-19 11:15:14,699 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 11:15:14,700 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:14,700 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 20 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1352 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:14,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1352 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:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 11:15:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2024-11-19 11:15:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 225 states have (on average 1.551111111111111) internal successors, (349), 232 states have internal predecessors, (349), 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:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 445 transitions. [2024-11-19 11:15:14,712 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 445 transitions. Word has length 112 [2024-11-19 11:15:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:14,712 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 445 transitions. [2024-11-19 11:15:14,713 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:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 445 transitions. [2024-11-19 11:15:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 11:15:14,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:14,715 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:14,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:14,915 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:14,916 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:14,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2058156192, now seen corresponding path program 1 times [2024-11-19 11:15:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417749402] [2024-11-19 11:15:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,020 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,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417749402] [2024-11-19 11:15:15,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417749402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327051606] [2024-11-19 11:15:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:15,023 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,025 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,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:15,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:15,223 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,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327051606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732906147] [2024-11-19 11:15:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:15,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:15,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:15,226 INFO L87 Difference]: Start difference. First operand 289 states and 445 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,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:15,265 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2024-11-19 11:15:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:15,266 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,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:15,268 INFO L225 Difference]: With dead ends: 298 [2024-11-19 11:15:15,268 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 11:15:15,269 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,269 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 8 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:15,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 840 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 11:15:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2024-11-19 11:15:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 226 states have (on average 1.5486725663716814) internal successors, (350), 233 states have internal predecessors, (350), 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,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-19 11:15:15,282 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 117 [2024-11-19 11:15:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-19 11:15:15,283 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,283 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-19 11:15:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 11:15:15,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:15,285 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,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:15,485 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:15,486 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:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -621667153, now seen corresponding path program 1 times [2024-11-19 11:15:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886573520] [2024-11-19 11:15:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,629 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,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886573520] [2024-11-19 11:15:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886573520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547898405] [2024-11-19 11:15:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:15,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:15,632 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:15,633 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:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:15,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:15:15,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:15,837 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,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547898405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-19 11:15:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178637172] [2024-11-19 11:15:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:15,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:15:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:15:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 11:15:15,839 INFO L87 Difference]: Start difference. First operand 290 states and 446 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:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:15,873 INFO L93 Difference]: Finished difference Result 293 states and 449 transitions. [2024-11-19 11:15:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:15:15,873 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:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:15,875 INFO L225 Difference]: With dead ends: 293 [2024-11-19 11:15:15,876 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 11:15:15,876 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:15,877 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:15,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 851 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 11:15:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-11-19 11:15:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 234 states have internal predecessors, (351), 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,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 447 transitions. [2024-11-19 11:15:15,888 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 447 transitions. Word has length 118 [2024-11-19 11:15:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:15,891 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 447 transitions. [2024-11-19 11:15:15,891 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:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 447 transitions. [2024-11-19 11:15:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 11:15:15,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:15,893 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:15,912 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,094 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,094 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,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -43452988, now seen corresponding path program 1 times [2024-11-19 11:15:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704007793] [2024-11-19 11:15:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704007793] [2024-11-19 11:15:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704007793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325545285] [2024-11-19 11:15:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:16,222 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,225 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,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:16,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:16,436 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,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325545285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427132675] [2024-11-19 11:15:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:16,439 INFO L87 Difference]: Start difference. First operand 291 states and 447 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:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:16,486 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2024-11-19 11:15:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:16,486 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:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:16,489 INFO L225 Difference]: With dead ends: 299 [2024-11-19 11:15:16,489 INFO L226 Difference]: Without dead ends: 298 [2024-11-19 11:15:16,489 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:16,490 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 10 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:16,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1078 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-19 11:15:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 292. [2024-11-19 11:15:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.543859649122807) internal successors, (352), 235 states have internal predecessors, (352), 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,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-19 11:15:16,502 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 119 [2024-11-19 11:15:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:16,503 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-19 11:15:16,503 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:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-19 11:15:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 11:15:16,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:16,505 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,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 11:15:16,705 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:16,706 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:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1625366468, now seen corresponding path program 1 times [2024-11-19 11:15:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717883473] [2024-11-19 11:15:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:16,834 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,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717883473] [2024-11-19 11:15:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717883473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104836421] [2024-11-19 11:15:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:16,837 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:16,838 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,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:15:17,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:17,059 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,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104836421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:17,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:17,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-19 11:15:17,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144595759] [2024-11-19 11:15:17,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:17,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:15:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:15:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:15:17,062 INFO L87 Difference]: Start difference. First operand 292 states and 448 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,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:17,110 INFO L93 Difference]: Finished difference Result 300 states and 462 transitions. [2024-11-19 11:15:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:15:17,111 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,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:17,113 INFO L225 Difference]: With dead ends: 300 [2024-11-19 11:15:17,113 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 11:15:17,114 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,114 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 12 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:17,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1069 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 11:15:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 290. [2024-11-19 11:15:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.5418502202643172) internal successors, (350), 233 states have internal predecessors, (350), 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,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-19 11:15:17,127 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 119 [2024-11-19 11:15:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:17,127 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-19 11:15:17,127 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,128 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-19 11:15:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 11:15:17,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:17,129 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,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-19 11:15:17,330 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,331 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,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1347042293, now seen corresponding path program 1 times [2024-11-19 11:15:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:17,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051723898] [2024-11-19 11:15:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,442 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,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051723898] [2024-11-19 11:15:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051723898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932500524] [2024-11-19 11:15:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:17,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:17,445 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,446 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:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:17,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:17,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:17,696 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,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932500524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:17,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:17,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266247477] [2024-11-19 11:15:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:17,698 INFO L87 Difference]: Start difference. First operand 290 states and 446 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:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:17,749 INFO L93 Difference]: Finished difference Result 295 states and 452 transitions. [2024-11-19 11:15:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:17,749 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:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:17,752 INFO L225 Difference]: With dead ends: 295 [2024-11-19 11:15:17,752 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 11:15:17,752 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:17,753 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 19 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:17,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:15:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 11:15:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2024-11-19 11:15:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 227 states have (on average 1.5418502202643172) internal successors, (350), 233 states have internal predecessors, (350), 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,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-11-19 11:15:17,767 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 120 [2024-11-19 11:15:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:17,767 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-11-19 11:15:17,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:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-11-19 11:15:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 11:15:17,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:17,770 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,787 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:17,970 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:17,971 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:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1153246709, now seen corresponding path program 1 times [2024-11-19 11:15:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283940945] [2024-11-19 11:15:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,074 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,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283940945] [2024-11-19 11:15:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283940945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007772468] [2024-11-19 11:15:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:18,077 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,079 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,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:15:18,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:18,307 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,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007772468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-19 11:15:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171424934] [2024-11-19 11:15:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:18,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:15:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:18,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:15:18,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:15:18,310 INFO L87 Difference]: Start difference. First operand 290 states and 446 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,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:18,378 INFO L93 Difference]: Finished difference Result 505 states and 777 transitions. [2024-11-19 11:15:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:15:18,379 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,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:18,381 INFO L225 Difference]: With dead ends: 505 [2024-11-19 11:15:18,381 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 11:15:18,382 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,383 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 16 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:18,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1440 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 11:15:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 292. [2024-11-19 11:15:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 229 states have (on average 1.537117903930131) internal successors, (352), 235 states have internal predecessors, (352), 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,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 448 transitions. [2024-11-19 11:15:18,395 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 448 transitions. Word has length 120 [2024-11-19 11:15:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 448 transitions. [2024-11-19 11:15:18,395 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,396 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2024-11-19 11:15:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 11:15:18,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:15:18,398 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,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-19 11:15:18,598 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,599 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,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:15:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1840912999, now seen corresponding path program 1 times [2024-11-19 11:15:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:15:18,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952413579] [2024-11-19 11:15:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:15:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,720 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,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:15:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952413579] [2024-11-19 11:15:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952413579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:15:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583522843] [2024-11-19 11:15:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:15:18,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:15:18,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:15:18,723 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:18,725 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:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:15:18,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 11:15:18,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:15:18,996 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,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:15:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583522843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:15:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:15:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-19 11:15:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468916845] [2024-11-19 11:15:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:15:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 11:15:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:15:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 11:15:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:18,999 INFO L87 Difference]: Start difference. First operand 292 states and 448 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,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:15:19,082 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2024-11-19 11:15:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:15:19,085 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,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:15:19,086 INFO L225 Difference]: With dead ends: 306 [2024-11-19 11:15:19,086 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 11:15:19,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:15:19,088 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 30 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:15:19,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1429 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:15:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 11:15:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 11:15:19,089 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,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 11:15:19,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-11-19 11:15:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:15:19,090 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 11:15:19,090 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,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 11:15:19,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 11:15:19,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 11:15:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 11:15:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 11:15:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 11:15:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 11:15:19,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 11:15:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 11:15:19,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 11:15:19,117 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,299 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,302 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,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 11:15:19,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:15:19,623 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,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:15:19,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:15:19,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:15:19,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:15:19,626 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:05" (3/4) ... [2024-11-19 11:15:19,629 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 11:15:19,633 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-11-19 11:15:19,633 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-11-19 11:15:19,633 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-19 11:15:19,633 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-11-19 11:15:19,634 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 11:15:19,634 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-11-19 11:15:19,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-19 11:15:19,651 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-19 11:15:19,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 11:15:19,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 11:15:19,691 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,740 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,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 11:15:19,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 11:15:19,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:15:19,805 INFO L158 Benchmark]: Toolchain (without parser) took 15479.77ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 110.0MB in the beginning and 190.8MB in the end (delta: -80.8MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,806 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 165.7MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:15:19,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.12ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 90.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.55ms. Allocated memory is still 165.7MB. Free memory was 90.6MB in the beginning and 87.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,808 INFO L158 Benchmark]: Boogie Preprocessor took 86.43ms. Allocated memory is still 165.7MB. Free memory was 87.0MB in the beginning and 83.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,808 INFO L158 Benchmark]: RCFGBuilder took 909.17ms. Allocated memory is still 165.7MB. Free memory was 83.2MB in the beginning and 109.9MB in the end (delta: -26.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,808 INFO L158 Benchmark]: TraceAbstraction took 13742.29ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 108.6MB in the beginning and 203.4MB in the end (delta: -94.7MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,808 INFO L158 Benchmark]: Witness Printer took 179.65ms. Allocated memory is still 323.0MB. Free memory was 203.4MB in the beginning and 190.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 11:15:19,810 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.27ms. Allocated memory is still 165.7MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.12ms. Allocated memory is still 165.7MB. Free memory was 109.5MB in the beginning and 90.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.55ms. Allocated memory is still 165.7MB. Free memory was 90.6MB in the beginning and 87.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.43ms. Allocated memory is still 165.7MB. Free memory was 87.0MB in the beginning and 83.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 909.17ms. Allocated memory is still 165.7MB. Free memory was 83.2MB in the beginning and 109.9MB in the end (delta: -26.7MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13742.29ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 108.6MB in the beginning and 203.4MB in the end (delta: -94.7MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 179.65ms. Allocated memory is still 323.0MB. Free memory was 203.4MB in the beginning and 190.8MB 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, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 21302 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15076 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 6226 mSDtfsCounter, 990 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.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred 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.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.6s 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: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) - 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: 526]: 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,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE