./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-dev-4a390ef-m [2024-10-24 20:47:13,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:47:13,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:47:13,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:47:13,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:47:13,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:47:13,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:47:13,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:47:13,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:47:13,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:47:13,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:47:13,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:47:13,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:47:13,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:47:13,185 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:47:13,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:47:13,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:47:13,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:47:13,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:47:13,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:47:13,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:47:13,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:47:13,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:47:13,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:47:13,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:47:13,189 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:47:13,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:47:13,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:47:13,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:47:13,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:47:13,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:47:13,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:47:13,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:47:13,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:47:13,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:13,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:47:13,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:47:13,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:47:13,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:47:13,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:47:13,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:47:13,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:47:13,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:47:13,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:47:13,195 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-10-24 20:47:13,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:47:13,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:47:13,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:47:13,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:47:13,482 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:47:13,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:15,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:47:15,249 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:47:15,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:15,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2a74e8eb/333a52ceb09040178621fae641b85c89/FLAG2611e3d49 [2024-10-24 20:47:15,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2a74e8eb/333a52ceb09040178621fae641b85c89 [2024-10-24 20:47:15,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:47:15,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:47:15,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:15,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:47:15,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:47:15,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f2a182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15, skipping insertion in model container [2024-10-24 20:47:15,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:47:15,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:15,614 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:47:15,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:15,715 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:47:15,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15 WrapperNode [2024-10-24 20:47:15,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:15,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:15,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:47:15,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:47:15,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,768 INFO L138 Inliner]: procedures = 28, calls = 52, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 428 [2024-10-24 20:47:15,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:15,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:47:15,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:47:15,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:47:15,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 20:47:15,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:47:15,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:47:15,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:47:15,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:47:15,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (1/1) ... [2024-10-24 20:47:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:15,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:47:15,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:47:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:47:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-24 20:47:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-24 20:47:15,972 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 20:47:15,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 20:47:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-24 20:47:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-24 20:47:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-24 20:47:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-24 20:47:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-24 20:47:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-24 20:47:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:47:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:47:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:47:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:47:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:47:16,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:47:16,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:47:16,771 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-24 20:47:16,772 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:47:16,823 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:47:16,825 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 20:47:16,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:16 BoogieIcfgContainer [2024-10-24 20:47:16,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:47:16,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:47:16,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:47:16,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:47:16,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:47:15" (1/3) ... [2024-10-24 20:47:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1a6aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:16, skipping insertion in model container [2024-10-24 20:47:16,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:15" (2/3) ... [2024-10-24 20:47:16,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1a6aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:16, skipping insertion in model container [2024-10-24 20:47:16,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:16" (3/3) ... [2024-10-24 20:47:16,834 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.UNBOUNDED.pals.c [2024-10-24 20:47:16,850 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:47:16,851 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-24 20:47:16,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:47:16,920 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;@9d1b8b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:47:16,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 20:47:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 147 states have internal predecessors, (219), 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-10-24 20:47:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 20:47:16,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:16,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:16,935 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-10-24 20:47:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1192890858, now seen corresponding path program 1 times [2024-10-24 20:47:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:16,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040031133] [2024-10-24 20:47:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040031133] [2024-10-24 20:47:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040031133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:17,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:47:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272268103] [2024-10-24 20:47:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:17,317 INFO L87 Difference]: Start difference. First operand has 187 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 147 states have internal predecessors, (219), 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.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-24 20:47:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:17,467 INFO L93 Difference]: Finished difference Result 394 states and 653 transitions. [2024-10-24 20:47:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-10-24 20:47:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:17,488 INFO L225 Difference]: With dead ends: 394 [2024-10-24 20:47:17,488 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 20:47:17,497 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-10-24 20:47:17,501 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 37 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:17,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 847 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 20:47:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2024-10-24 20:47:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 160 states have internal predecessors, (235), 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-10-24 20:47:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 311 transitions. [2024-10-24 20:47:17,571 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 311 transitions. Word has length 10 [2024-10-24 20:47:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 311 transitions. [2024-10-24 20:47:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-24 20:47:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 311 transitions. [2024-10-24 20:47:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 20:47:17,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:17,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:17,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:47:17,576 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-10-24 20:47:17,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1904217733, now seen corresponding path program 1 times [2024-10-24 20:47:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171436270] [2024-10-24 20:47:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171436270] [2024-10-24 20:47:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171436270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:17,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:47:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546177033] [2024-10-24 20:47:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:17,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:17,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:17,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:17,779 INFO L87 Difference]: Start difference. First operand 202 states and 311 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-24 20:47:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:17,864 INFO L93 Difference]: Finished difference Result 428 states and 668 transitions. [2024-10-24 20:47:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-24 20:47:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:17,873 INFO L225 Difference]: With dead ends: 428 [2024-10-24 20:47:17,873 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 20:47:17,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:17,878 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 19 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:17,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 850 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 20:47:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2024-10-24 20:47:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 175 states have (on average 1.542857142857143) internal successors, (270), 186 states have internal predecessors, (270), 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-10-24 20:47:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 356 transitions. [2024-10-24 20:47:17,921 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 356 transitions. Word has length 15 [2024-10-24 20:47:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:17,922 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 356 transitions. [2024-10-24 20:47:17,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-24 20:47:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 356 transitions. [2024-10-24 20:47:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 20:47:17,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:17,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:47:17,926 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-10-24 20:47:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2095029200, now seen corresponding path program 1 times [2024-10-24 20:47:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125375464] [2024-10-24 20:47:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125375464] [2024-10-24 20:47:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125375464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310004740] [2024-10-24 20:47:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:18,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:18,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:18,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:18,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:47:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:18,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:18,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310004740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:18,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-24 20:47:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144036025] [2024-10-24 20:47:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:18,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:18,338 INFO L87 Difference]: Start difference. First operand 233 states and 356 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-24 20:47:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:18,398 INFO L93 Difference]: Finished difference Result 237 states and 362 transitions. [2024-10-24 20:47:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 28 [2024-10-24 20:47:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:18,402 INFO L225 Difference]: With dead ends: 237 [2024-10-24 20:47:18,404 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 20:47:18,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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-10-24 20:47:18,406 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 19 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:18,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 812 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 20:47:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-10-24 20:47:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 175 states have (on average 1.5257142857142858) internal successors, (267), 185 states have internal predecessors, (267), 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-10-24 20:47:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 353 transitions. [2024-10-24 20:47:18,442 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 353 transitions. Word has length 28 [2024-10-24 20:47:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 353 transitions. [2024-10-24 20:47:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-24 20:47:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 353 transitions. [2024-10-24 20:47:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 20:47:18,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:18,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 20:47:18,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:47:18,647 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-10-24 20:47:18,648 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-10-24 20:47:18,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash 521396277, now seen corresponding path program 1 times [2024-10-24 20:47:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439178535] [2024-10-24 20:47:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 20:47:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:47:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439178535] [2024-10-24 20:47:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439178535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:47:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115608142] [2024-10-24 20:47:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:18,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:47:18,774 INFO L87 Difference]: Start difference. First operand 232 states and 353 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-24 20:47:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:18,821 INFO L93 Difference]: Finished difference Result 236 states and 359 transitions. [2024-10-24 20:47:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:18,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-24 20:47:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:18,824 INFO L225 Difference]: With dead ends: 236 [2024-10-24 20:47:18,824 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 20:47:18,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-24 20:47:18,828 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 18 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:18,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 814 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 20:47:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2024-10-24 20:47:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 160 states have internal predecessors, (231), 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-10-24 20:47:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 307 transitions. [2024-10-24 20:47:18,847 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 307 transitions. Word has length 29 [2024-10-24 20:47:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 307 transitions. [2024-10-24 20:47:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-10-24 20:47:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 307 transitions. [2024-10-24 20:47:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 20:47:18,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:18,852 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] [2024-10-24 20:47:18,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:47:18,852 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-10-24 20:47:18,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1882601904, now seen corresponding path program 1 times [2024-10-24 20:47:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248915672] [2024-10-24 20:47:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 20:47:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 20:47:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 20:47:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 20:47:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 20:47:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 20:47:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:19,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248915672] [2024-10-24 20:47:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248915672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141949901] [2024-10-24 20:47:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:19,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:19,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:47:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:19,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 20:47:19,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141949901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:19,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:19,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953541781] [2024-10-24 20:47:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:19,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:19,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:19,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:19,361 INFO L87 Difference]: Start difference. First operand 202 states and 307 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 20:47:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:19,441 INFO L93 Difference]: Finished difference Result 352 states and 543 transitions. [2024-10-24 20:47:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 90 [2024-10-24 20:47:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:19,447 INFO L225 Difference]: With dead ends: 352 [2024-10-24 20:47:19,447 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 20:47:19,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:19,450 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 10 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:19,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 818 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 20:47:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-24 20:47:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 166 states have internal predecessors, (239), 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-10-24 20:47:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2024-10-24 20:47:19,465 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 90 [2024-10-24 20:47:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:19,465 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2024-10-24 20:47:19,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 20:47:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2024-10-24 20:47:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 20:47:19,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:19,469 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] [2024-10-24 20:47:19,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:19,670 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-10-24 20:47:19,671 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-10-24 20:47:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 722979448, now seen corresponding path program 1 times [2024-10-24 20:47:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931623587] [2024-10-24 20:47:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 20:47:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 20:47:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 20:47:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 20:47:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 20:47:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 20:47:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931623587] [2024-10-24 20:47:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931623587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635915817] [2024-10-24 20:47:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:19,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:19,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:47:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:20,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-24 20:47:20,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635915817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:20,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025624548] [2024-10-24 20:47:20,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:20,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:20,128 INFO L87 Difference]: Start difference. First operand 209 states and 317 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 20:47:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:20,205 INFO L93 Difference]: Finished difference Result 366 states and 562 transitions. [2024-10-24 20:47:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:20,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 20:47:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:20,209 INFO L225 Difference]: With dead ends: 366 [2024-10-24 20:47:20,210 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 20:47:20,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:20,212 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 8 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:20,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 815 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 20:47:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-24 20:47:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 172 states have internal predecessors, (247), 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-10-24 20:47:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 327 transitions. [2024-10-24 20:47:20,228 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 327 transitions. Word has length 92 [2024-10-24 20:47:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:20,229 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 327 transitions. [2024-10-24 20:47:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-10-24 20:47:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 327 transitions. [2024-10-24 20:47:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 20:47:20,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:20,232 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] [2024-10-24 20:47:20,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:47:20,436 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-10-24 20:47:20,437 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-10-24 20:47:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash 983826510, now seen corresponding path program 1 times [2024-10-24 20:47:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188095436] [2024-10-24 20:47:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 20:47:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 20:47:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 20:47:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 20:47:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188095436] [2024-10-24 20:47:20,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188095436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506196609] [2024-10-24 20:47:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:20,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:20,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:20,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:47:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:20,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:20,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 20:47:20,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506196609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105765220] [2024-10-24 20:47:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:20,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:20,870 INFO L87 Difference]: Start difference. First operand 216 states and 327 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-10-24 20:47:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:21,002 INFO L93 Difference]: Finished difference Result 391 states and 612 transitions. [2024-10-24 20:47:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:21,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 93 [2024-10-24 20:47:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:21,004 INFO L225 Difference]: With dead ends: 391 [2024-10-24 20:47:21,005 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 20:47:21,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:21,008 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 39 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:21,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 776 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 20:47:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2024-10-24 20:47:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.5491329479768785) internal successors, (268), 184 states have internal predecessors, (268), 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-10-24 20:47:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 350 transitions. [2024-10-24 20:47:21,028 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 350 transitions. Word has length 93 [2024-10-24 20:47:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:21,029 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 350 transitions. [2024-10-24 20:47:21,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-10-24 20:47:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 350 transitions. [2024-10-24 20:47:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 20:47:21,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:21,033 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] [2024-10-24 20:47:21,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 20:47:21,235 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-10-24 20:47:21,235 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-10-24 20:47:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1517624601, now seen corresponding path program 1 times [2024-10-24 20:47:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405917052] [2024-10-24 20:47:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 20:47:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 20:47:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-24 20:47:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405917052] [2024-10-24 20:47:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405917052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117252193] [2024-10-24 20:47:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:21,462 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:21,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 20:47:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:21,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:21,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 20:47:21,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117252193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:21,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104838851] [2024-10-24 20:47:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:21,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:21,644 INFO L87 Difference]: Start difference. First operand 230 states and 350 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 20:47:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:21,715 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2024-10-24 20:47:21,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 96 [2024-10-24 20:47:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:21,718 INFO L225 Difference]: With dead ends: 466 [2024-10-24 20:47:21,718 INFO L226 Difference]: Without dead ends: 254 [2024-10-24 20:47:21,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:21,720 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 21 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:21,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 796 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-24 20:47:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-24 20:47:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 193 states have (on average 1.5647668393782384) internal successors, (302), 204 states have internal predecessors, (302), 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-10-24 20:47:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 388 transitions. [2024-10-24 20:47:21,731 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 388 transitions. Word has length 96 [2024-10-24 20:47:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:21,731 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 388 transitions. [2024-10-24 20:47:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 20:47:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 388 transitions. [2024-10-24 20:47:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 20:47:21,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:21,733 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] [2024-10-24 20:47:21,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:21,934 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-10-24 20:47:21,934 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-10-24 20:47:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -884165371, now seen corresponding path program 1 times [2024-10-24 20:47:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277874307] [2024-10-24 20:47:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 20:47:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-24 20:47:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277874307] [2024-10-24 20:47:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277874307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459424198] [2024-10-24 20:47:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:22,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:22,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:22,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 20:47:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:22,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-24 20:47:22,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459424198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 20:47:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4855244] [2024-10-24 20:47:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:22,327 INFO L87 Difference]: Start difference. First operand 254 states and 388 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 20:47:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:22,419 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2024-10-24 20:47:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 20:47:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:22,422 INFO L225 Difference]: With dead ends: 510 [2024-10-24 20:47:22,423 INFO L226 Difference]: Without dead ends: 274 [2024-10-24 20:47:22,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:22,425 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 19 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:22,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 783 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-24 20:47:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-10-24 20:47:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 209 states have (on average 1.569377990430622) internal successors, (328), 220 states have internal predecessors, (328), 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-10-24 20:47:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 418 transitions. [2024-10-24 20:47:22,446 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 418 transitions. Word has length 98 [2024-10-24 20:47:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:22,447 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 418 transitions. [2024-10-24 20:47:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-10-24 20:47:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 418 transitions. [2024-10-24 20:47:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 20:47:22,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:22,449 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] [2024-10-24 20:47:22,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 20:47:22,650 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-10-24 20:47:22,651 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-10-24 20:47:22,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1267993251, now seen corresponding path program 1 times [2024-10-24 20:47:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:22,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199964017] [2024-10-24 20:47:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 20:47:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199964017] [2024-10-24 20:47:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199964017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818646443] [2024-10-24 20:47:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:22,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:22,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:22,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 20:47:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:22,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:23,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:23,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818646443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891849787] [2024-10-24 20:47:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:23,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:23,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,038 INFO L87 Difference]: Start difference. First operand 274 states and 418 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-10-24 20:47:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:23,090 INFO L93 Difference]: Finished difference Result 282 states and 433 transitions. [2024-10-24 20:47:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 99 [2024-10-24 20:47:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:23,093 INFO L225 Difference]: With dead ends: 282 [2024-10-24 20:47:23,093 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 20:47:23,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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-10-24 20:47:23,094 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 12 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:23,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 833 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 20:47:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2024-10-24 20:47:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 219 states have internal predecessors, (327), 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-10-24 20:47:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 417 transitions. [2024-10-24 20:47:23,107 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 417 transitions. Word has length 99 [2024-10-24 20:47:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 417 transitions. [2024-10-24 20:47:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-10-24 20:47:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 417 transitions. [2024-10-24 20:47:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 20:47:23,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:23,109 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] [2024-10-24 20:47:23,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 20:47:23,310 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-10-24 20:47:23,310 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-10-24 20:47:23,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash -653084806, now seen corresponding path program 1 times [2024-10-24 20:47:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366499011] [2024-10-24 20:47:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 20:47:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366499011] [2024-10-24 20:47:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366499011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:23,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467598851] [2024-10-24 20:47:23,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:23,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:23,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 20:47:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:23,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:23,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-24 20:47:23,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467598851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171132919] [2024-10-24 20:47:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:23,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,688 INFO L87 Difference]: Start difference. First operand 273 states and 417 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 20:47:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:23,735 INFO L93 Difference]: Finished difference Result 467 states and 717 transitions. [2024-10-24 20:47:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 100 [2024-10-24 20:47:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:23,738 INFO L225 Difference]: With dead ends: 467 [2024-10-24 20:47:23,738 INFO L226 Difference]: Without dead ends: 283 [2024-10-24 20:47:23,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:23,740 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 11 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:23,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 823 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-24 20:47:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-24 20:47:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 218 states have (on average 1.5596330275229358) internal successors, (340), 227 states have internal predecessors, (340), 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-10-24 20:47:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 434 transitions. [2024-10-24 20:47:23,755 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 434 transitions. Word has length 100 [2024-10-24 20:47:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:23,756 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 434 transitions. [2024-10-24 20:47:23,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-10-24 20:47:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2024-10-24 20:47:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 20:47:23,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:23,760 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] [2024-10-24 20:47:23,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 20:47:23,960 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-10-24 20:47:23,961 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-10-24 20:47:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 744797739, now seen corresponding path program 1 times [2024-10-24 20:47:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306966384] [2024-10-24 20:47:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306966384] [2024-10-24 20:47:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306966384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580779379] [2024-10-24 20:47:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:24,170 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:24,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 20:47:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:24,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:24,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580779379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:24,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621461496] [2024-10-24 20:47:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:24,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:24,359 INFO L87 Difference]: Start difference. First operand 283 states and 434 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, (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-10-24 20:47:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:24,407 INFO L93 Difference]: Finished difference Result 294 states and 453 transitions. [2024-10-24 20:47:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:24,408 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, (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 107 [2024-10-24 20:47:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:24,410 INFO L225 Difference]: With dead ends: 294 [2024-10-24 20:47:24,410 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 20:47:24,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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-10-24 20:47:24,412 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 10 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 819 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-10-24 20:47:24,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 819 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 20:47:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2024-10-24 20:47:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 228 states have internal predecessors, (341), 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-10-24 20:47:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-24 20:47:24,425 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 107 [2024-10-24 20:47:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-24 20:47:24,426 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, (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-10-24 20:47:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-24 20:47:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 20:47:24,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:24,428 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] [2024-10-24 20:47:24,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 20:47:24,629 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-10-24 20:47:24,629 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-10-24 20:47:24,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1613893752, now seen corresponding path program 1 times [2024-10-24 20:47:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044263786] [2024-10-24 20:47:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044263786] [2024-10-24 20:47:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044263786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040183105] [2024-10-24 20:47:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:24,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:24,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:24,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 20:47:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:24,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:24,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:25,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040183105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:25,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277603213] [2024-10-24 20:47:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:25,021 INFO L87 Difference]: Start difference. First operand 284 states and 435 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, (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-10-24 20:47:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:25,070 INFO L93 Difference]: Finished difference Result 286 states and 437 transitions. [2024-10-24 20:47:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:25,071 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, (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 108 [2024-10-24 20:47:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:25,073 INFO L225 Difference]: With dead ends: 286 [2024-10-24 20:47:25,073 INFO L226 Difference]: Without dead ends: 285 [2024-10-24 20:47:25,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:25,073 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 9 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:25,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 847 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-24 20:47:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-24 20:47:25,084 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-10-24 20:47:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 436 transitions. [2024-10-24 20:47:25,086 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 436 transitions. Word has length 108 [2024-10-24 20:47:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:25,087 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 436 transitions. [2024-10-24 20:47:25,087 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, (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-10-24 20:47:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 436 transitions. [2024-10-24 20:47:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 20:47:25,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:25,089 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-10-24 20:47:25,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-24 20:47:25,290 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-10-24 20:47:25,290 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-10-24 20:47:25,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 449697039, now seen corresponding path program 1 times [2024-10-24 20:47:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424049957] [2024-10-24 20:47:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:25,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:25,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424049957] [2024-10-24 20:47:25,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424049957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007834038] [2024-10-24 20:47:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:25,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:25,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 20:47:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:25,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:25,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:25,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007834038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:25,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 20:47:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900855915] [2024-10-24 20:47:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:25,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:25,661 INFO L87 Difference]: Start difference. First operand 285 states and 436 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-24 20:47:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:25,711 INFO L93 Difference]: Finished difference Result 290 states and 446 transitions. [2024-10-24 20:47:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-24 20:47:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:25,714 INFO L225 Difference]: With dead ends: 290 [2024-10-24 20:47:25,714 INFO L226 Difference]: Without dead ends: 289 [2024-10-24 20:47:25,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:25,715 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 12 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:25,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1058 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-24 20:47:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-24 20:47:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 220 states have (on average 1.55) internal successors, (341), 228 states have internal predecessors, (341), 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-10-24 20:47:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 435 transitions. [2024-10-24 20:47:25,725 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 435 transitions. Word has length 109 [2024-10-24 20:47:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:25,726 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 435 transitions. [2024-10-24 20:47:25,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-10-24 20:47:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 435 transitions. [2024-10-24 20:47:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 20:47:25,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:25,729 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-10-24 20:47:25,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:25,929 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-10-24 20:47:25,930 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-10-24 20:47:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1055706644, now seen corresponding path program 1 times [2024-10-24 20:47:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899154174] [2024-10-24 20:47:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 20:47:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:26,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899154174] [2024-10-24 20:47:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899154174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:26,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243888764] [2024-10-24 20:47:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:26,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:26,117 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-10-24 20:47:26,118 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-10-24 20:47:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:26,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 20:47:26,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243888764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167074463] [2024-10-24 20:47:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:26,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:26,332 INFO L87 Difference]: Start difference. First operand 284 states and 435 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-10-24 20:47:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:26,400 INFO L93 Difference]: Finished difference Result 486 states and 748 transitions. [2024-10-24 20:47:26,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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 110 [2024-10-24 20:47:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:26,403 INFO L225 Difference]: With dead ends: 486 [2024-10-24 20:47:26,403 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 20:47:26,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:26,404 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 20 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1372 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 20:47:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2024-10-24 20:47:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 223 states have (on average 1.5560538116591929) internal successors, (347), 230 states have internal predecessors, (347), 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-10-24 20:47:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 443 transitions. [2024-10-24 20:47:26,415 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 443 transitions. Word has length 110 [2024-10-24 20:47:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:26,416 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 443 transitions. [2024-10-24 20:47:26,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-10-24 20:47:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 443 transitions. [2024-10-24 20:47:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 20:47:26,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:26,418 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] [2024-10-24 20:47:26,438 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-10-24 20:47:26,622 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-10-24 20:47:26,623 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-10-24 20:47:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 67340857, now seen corresponding path program 1 times [2024-10-24 20:47:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960790458] [2024-10-24 20:47:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 20:47:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960790458] [2024-10-24 20:47:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960790458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952614673] [2024-10-24 20:47:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:26,789 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-10-24 20:47:26,790 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-10-24 20:47:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:26,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:26,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:27,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:27,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952614673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:27,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490877076] [2024-10-24 20:47:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:27,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:27,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:27,002 INFO L87 Difference]: Start difference. First operand 287 states and 443 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, (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-10-24 20:47:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:27,051 INFO L93 Difference]: Finished difference Result 296 states and 458 transitions. [2024-10-24 20:47:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:27,052 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, (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 115 [2024-10-24 20:47:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:27,054 INFO L225 Difference]: With dead ends: 296 [2024-10-24 20:47:27,054 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 20:47:27,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:27,056 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 8 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:27,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 830 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 20:47:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 288. [2024-10-24 20:47:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 231 states have internal predecessors, (348), 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-10-24 20:47:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 444 transitions. [2024-10-24 20:47:27,069 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 444 transitions. Word has length 115 [2024-10-24 20:47:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:27,071 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 444 transitions. [2024-10-24 20:47:27,071 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, (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-10-24 20:47:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 444 transitions. [2024-10-24 20:47:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 20:47:27,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:27,073 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] [2024-10-24 20:47:27,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 20:47:27,274 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-10-24 20:47:27,274 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-10-24 20:47:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2087566902, now seen corresponding path program 1 times [2024-10-24 20:47:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896868400] [2024-10-24 20:47:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 20:47:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:27,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896868400] [2024-10-24 20:47:27,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896868400] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:27,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603779141] [2024-10-24 20:47:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:27,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:27,435 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-10-24 20:47:27,437 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-10-24 20:47:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:27,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:27,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:27,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603779141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:27,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:27,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-24 20:47:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490326041] [2024-10-24 20:47:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:27,665 INFO L87 Difference]: Start difference. First operand 288 states and 444 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, (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-10-24 20:47:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:27,709 INFO L93 Difference]: Finished difference Result 291 states and 447 transitions. [2024-10-24 20:47:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:27,710 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, (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 116 [2024-10-24 20:47:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:27,712 INFO L225 Difference]: With dead ends: 291 [2024-10-24 20:47:27,712 INFO L226 Difference]: Without dead ends: 290 [2024-10-24 20:47:27,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 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-10-24 20:47:27,713 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 7 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:27,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 830 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-24 20:47:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2024-10-24 20:47:27,722 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-10-24 20:47:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 445 transitions. [2024-10-24 20:47:27,725 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 445 transitions. Word has length 116 [2024-10-24 20:47:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:27,728 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 445 transitions. [2024-10-24 20:47:27,728 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, (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-10-24 20:47:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 445 transitions. [2024-10-24 20:47:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 20:47:27,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:27,730 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-10-24 20:47:27,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:27,930 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-10-24 20:47:27,931 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-10-24 20:47:27,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1956543203, now seen corresponding path program 1 times [2024-10-24 20:47:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289589636] [2024-10-24 20:47:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 20:47:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:28,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289589636] [2024-10-24 20:47:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289589636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873345364] [2024-10-24 20:47:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:28,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:28,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:28,180 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-10-24 20:47:28,182 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-10-24 20:47:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:28,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:28,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873345364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:28,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 20:47:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044503802] [2024-10-24 20:47:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:28,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:28,399 INFO L87 Difference]: Start difference. First operand 289 states and 445 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, (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-10-24 20:47:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:28,464 INFO L93 Difference]: Finished difference Result 297 states and 459 transitions. [2024-10-24 20:47:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:28,465 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, (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-10-24 20:47:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:28,467 INFO L225 Difference]: With dead ends: 297 [2024-10-24 20:47:28,467 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 20:47:28,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:47:28,468 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:28,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 20:47:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2024-10-24 20:47:28,476 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-10-24 20:47:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-10-24 20:47:28,479 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 117 [2024-10-24 20:47:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-10-24 20:47:28,479 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, (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-10-24 20:47:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-10-24 20:47:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 20:47:28,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:28,481 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-10-24 20:47:28,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-24 20:47:28,682 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-10-24 20:47:28,682 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-10-24 20:47:28,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:28,682 INFO L85 PathProgramCache]: Analyzing trace with hash -287723747, now seen corresponding path program 1 times [2024-10-24 20:47:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098684990] [2024-10-24 20:47:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 20:47:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098684990] [2024-10-24 20:47:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098684990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370450509] [2024-10-24 20:47:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:28,843 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-10-24 20:47:28,846 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-10-24 20:47:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:29,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:29,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370450509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:29,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886990288] [2024-10-24 20:47:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:29,071 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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-10-24 20:47:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:29,146 INFO L93 Difference]: Finished difference Result 304 states and 468 transitions. [2024-10-24 20:47:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:29,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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 117 [2024-10-24 20:47:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:29,150 INFO L225 Difference]: With dead ends: 304 [2024-10-24 20:47:29,150 INFO L226 Difference]: Without dead ends: 303 [2024-10-24 20:47:29,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:29,151 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 17 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:29,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1127 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-24 20:47:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 295. [2024-10-24 20:47:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 237 states have internal predecessors, (355), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 20:47:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 453 transitions. [2024-10-24 20:47:29,177 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 453 transitions. Word has length 117 [2024-10-24 20:47:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:29,177 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 453 transitions. [2024-10-24 20:47:29,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 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-10-24 20:47:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 453 transitions. [2024-10-24 20:47:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 20:47:29,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:29,180 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-10-24 20:47:29,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-24 20:47:29,381 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-10-24 20:47:29,381 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-10-24 20:47:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -523296814, now seen corresponding path program 1 times [2024-10-24 20:47:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496166848] [2024-10-24 20:47:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 20:47:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:29,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496166848] [2024-10-24 20:47:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496166848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809135685] [2024-10-24 20:47:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:29,546 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-10-24 20:47:29,547 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-10-24 20:47:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:29,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:29,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:29,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809135685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:29,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602761887] [2024-10-24 20:47:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:29,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:29,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:29,783 INFO L87 Difference]: Start difference. First operand 295 states and 453 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, (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-10-24 20:47:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:29,843 INFO L93 Difference]: Finished difference Result 300 states and 459 transitions. [2024-10-24 20:47:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:29,843 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, (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 118 [2024-10-24 20:47:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:29,846 INFO L225 Difference]: With dead ends: 300 [2024-10-24 20:47:29,846 INFO L226 Difference]: Without dead ends: 299 [2024-10-24 20:47:29,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:29,847 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 19 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:29,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-24 20:47:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2024-10-24 20:47:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.5434782608695652) internal successors, (355), 237 states have internal predecessors, (355), 49 states have call successors, (49), 14 states have call predecessors, (49), 14 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 20:47:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 453 transitions. [2024-10-24 20:47:29,864 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 453 transitions. Word has length 118 [2024-10-24 20:47:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 453 transitions. [2024-10-24 20:47:29,864 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, (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-10-24 20:47:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 453 transitions. [2024-10-24 20:47:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 20:47:29,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:29,867 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-10-24 20:47:29,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-24 20:47:30,067 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-10-24 20:47:30,068 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-10-24 20:47:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -329501230, now seen corresponding path program 1 times [2024-10-24 20:47:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360856981] [2024-10-24 20:47:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 20:47:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 20:47:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:30,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:30,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360856981] [2024-10-24 20:47:30,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360856981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:30,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390854657] [2024-10-24 20:47:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:30,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:30,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:30,227 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-10-24 20:47:30,251 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-10-24 20:47:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:30,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:30,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390854657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:30,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 20:47:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660277240] [2024-10-24 20:47:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:47:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:30,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:47:30,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:30,472 INFO L87 Difference]: Start difference. First operand 295 states and 453 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, (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-10-24 20:47:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:30,530 INFO L93 Difference]: Finished difference Result 510 states and 784 transitions. [2024-10-24 20:47:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:47:30,531 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, (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 118 [2024-10-24 20:47:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:30,533 INFO L225 Difference]: With dead ends: 510 [2024-10-24 20:47:30,533 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 20:47:30,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:30,535 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 24 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:30,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1093 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 20:47:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 291. [2024-10-24 20:47:30,544 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-10-24 20:47:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 447 transitions. [2024-10-24 20:47:30,547 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 447 transitions. Word has length 118 [2024-10-24 20:47:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:30,547 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 447 transitions. [2024-10-24 20:47:30,547 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, (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-10-24 20:47:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 447 transitions. [2024-10-24 20:47:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 20:47:30,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:30,550 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-10-24 20:47:30,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:30,754 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-10-24 20:47:30,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:30,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 379879681, now seen corresponding path program 1 times [2024-10-24 20:47:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111901610] [2024-10-24 20:47:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 20:47:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111901610] [2024-10-24 20:47:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111901610] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930470581] [2024-10-24 20:47:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:30,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:30,944 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-10-24 20:47:30,946 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-10-24 20:47:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 20:47:31,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:31,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930470581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-24 20:47:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924047497] [2024-10-24 20:47:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:47:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:47:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:47:31,196 INFO L87 Difference]: Start difference. First operand 291 states and 447 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 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-10-24 20:47:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:31,267 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2024-10-24 20:47:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:47:31,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 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 119 [2024-10-24 20:47:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:31,272 INFO L225 Difference]: With dead ends: 306 [2024-10-24 20:47:31,272 INFO L226 Difference]: Without dead ends: 305 [2024-10-24 20:47:31,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-24 20:47:31,275 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 30 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:31,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1333 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-24 20:47:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2024-10-24 20:47:31,285 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-10-24 20:47:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 446 transitions. [2024-10-24 20:47:31,287 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 446 transitions. Word has length 119 [2024-10-24 20:47:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:31,287 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 446 transitions. [2024-10-24 20:47:31,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 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-10-24 20:47:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 446 transitions. [2024-10-24 20:47:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 20:47:31,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:31,291 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-10-24 20:47:31,310 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-10-24 20:47:31,491 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-10-24 20:47:31,491 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-24 20:47:31,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1108631442, now seen corresponding path program 1 times [2024-10-24 20:47:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333705760] [2024-10-24 20:47:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:47:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 20:47:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:47:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 20:47:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 20:47:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 20:47:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 20:47:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 20:47:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 20:47:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 20:47:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 20:47:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 20:47:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333705760] [2024-10-24 20:47:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333705760] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855552998] [2024-10-24 20:47:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:31,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:31,667 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:31,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-24 20:47:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:31,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:47:31,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-24 20:47:31,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855552998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-24 20:47:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412688571] [2024-10-24 20:47:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:31,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:47:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:47:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:47:31,922 INFO L87 Difference]: Start difference. First operand 290 states and 446 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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-10-24 20:47:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:32,029 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2024-10-24 20:47:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:47:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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 120 [2024-10-24 20:47:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:32,031 INFO L225 Difference]: With dead ends: 304 [2024-10-24 20:47:32,031 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:47:32,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:47:32,032 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 27 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:32,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1873 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:47:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:47:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:47:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:47:32,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-10-24 20:47:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:47:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 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-10-24 20:47:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:47:32,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:47:32,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-24 20:47:32,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-24 20:47:32,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-24 20:47:32,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-24 20:47:32,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-24 20:47:32,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-24 20:47:32,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-24 20:47:32,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location add_history_typeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-24 20:47:32,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-24 20:47:32,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-24 20:47:32,245 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, 1] [2024-10-24 20:47:32,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:47:32,591 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:47:32,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:47:32 BoogieIcfgContainer [2024-10-24 20:47:32,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:47:32,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:47:32,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:47:32,632 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:47:32,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:16" (3/4) ... [2024-10-24 20:47:32,634 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:47:32,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_int8 [2024-10-24 20:47:32,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_history_bool [2024-10-24 20:47:32,638 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-24 20:47:32,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure add_history_type [2024-10-24 20:47:32,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 20:47:32,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure write_history_bool [2024-10-24 20:47:32,654 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-24 20:47:32,659 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-24 20:47:32,660 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:47:32,661 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:47:32,697 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-24 20:47:32,744 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < (var + 2147483649)) && ((\old(history_id) != 0) || (history_id == 0))) [2024-10-24 20:47:32,796 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:47:32,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:47:32,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:47:32,800 INFO L158 Benchmark]: Toolchain (without parser) took 17514.12ms. Allocated memory was 153.1MB in the beginning and 274.7MB in the end (delta: 121.6MB). Free memory was 98.0MB in the beginning and 103.1MB in the end (delta: -5.1MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,800 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 153.1MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:47:32,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.10ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 79.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 75.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,800 INFO L158 Benchmark]: Boogie Preprocessor took 99.32ms. Allocated memory is still 153.1MB. Free memory was 75.5MB in the beginning and 71.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,801 INFO L158 Benchmark]: RCFGBuilder took 955.92ms. Allocated memory is still 153.1MB. Free memory was 71.9MB in the beginning and 107.9MB in the end (delta: -36.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,801 INFO L158 Benchmark]: TraceAbstraction took 15802.56ms. Allocated memory was 153.1MB in the beginning and 274.7MB in the end (delta: 121.6MB). Free memory was 107.2MB in the beginning and 115.7MB in the end (delta: -8.5MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,801 INFO L158 Benchmark]: Witness Printer took 168.83ms. Allocated memory is still 274.7MB. Free memory was 114.6MB in the beginning and 103.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:47:32,802 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 153.1MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.10ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 79.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 153.1MB. Free memory was 79.1MB in the beginning and 75.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.32ms. Allocated memory is still 153.1MB. Free memory was 75.5MB in the beginning and 71.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 955.92ms. Allocated memory is still 153.1MB. Free memory was 71.9MB in the beginning and 107.9MB in the end (delta: -36.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15802.56ms. Allocated memory was 153.1MB in the beginning and 274.7MB in the end (delta: 121.6MB). Free memory was 107.2MB in the beginning and 115.7MB in the end (delta: -8.5MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. * Witness Printer took 168.83ms. Allocated memory is still 274.7MB. Free memory was 114.6MB in the beginning and 103.1MB in the end (delta: 11.5MB). 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, 187 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 22396 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15964 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1202 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 6432 mSDtfsCounter, 1202 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2639 GetRequests, 2470 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=19, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 132 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 4194 NumberOfCodeBlocks, 4194 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4151 ConstructedInterpolants, 0 QuantifiedInterpolants, 6366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10478 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 1927/1991 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-10-24 20:47:32,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE