./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:59:26,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:59:27,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 09:59:27,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:59:27,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:59:27,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:59:27,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:59:27,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:59:27,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:59:27,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:59:27,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:59:27,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:59:27,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:59:27,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:59:27,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:59:27,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:59:27,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 09:59:27,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:59:27,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:59:27,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:59:27,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:59:27,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 09:59:27,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:59:27,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 09:59:27,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:59:27,078 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 09:59:27,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:59:27,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:59:27,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 09:59:27,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:59:27,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:59:27,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:59:27,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:59:27,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:59:27,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:59:27,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:59:27,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:59:27,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 09:59:27,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:59:27,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:59:27,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:59:27,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:59:27,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:59:27,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:59:27,085 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-19 09:59:27,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:59:27,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:59:27,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:59:27,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:59:27,349 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:59:27,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-19 09:59:28,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:59:28,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:59:28,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-19 09:59:29,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a533a75f/9c517ffd0ed84842bcf16ef81b2ecc73/FLAGed5c7d223 [2024-11-19 09:59:29,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a533a75f/9c517ffd0ed84842bcf16ef81b2ecc73 [2024-11-19 09:59:29,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:59:29,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:59:29,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:59:29,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:59:29,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:59:29,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca6313f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29, skipping insertion in model container [2024-11-19 09:59:29,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:59:29,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:59:29,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:59:29,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:59:29,334 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:59:29,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29 WrapperNode [2024-11-19 09:59:29,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:59:29,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:59:29,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:59:29,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:59:29,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,387 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2024-11-19 09:59:29,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:59:29,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:59:29,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:59:29,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:59:29,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,433 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-19 09:59:29,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:59:29,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:59:29,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:59:29,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:59:29,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (1/1) ... [2024-11-19 09:59:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:59:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:29,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:59:29,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:59:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:59:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:59:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:59:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:59:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:59:29,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:59:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:59:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:59:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:59:29,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:59:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:59:29,634 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:59:29,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:59:29,933 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-19 09:59:29,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:59:29,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:59:29,951 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 09:59:29,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:29 BoogieIcfgContainer [2024-11-19 09:59:29,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:59:29,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:59:29,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:59:29,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:59:29,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:59:29" (1/3) ... [2024-11-19 09:59:29,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf5e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:29, skipping insertion in model container [2024-11-19 09:59:29,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:29" (2/3) ... [2024-11-19 09:59:29,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf5e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:29, skipping insertion in model container [2024-11-19 09:59:29,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:29" (3/3) ... [2024-11-19 09:59:29,980 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-19 09:59:30,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:59:30,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-19 09:59:30,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:59:30,074 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;@362cf317, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:59:30,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-19 09:59:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 100 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:59:30,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:30,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:59:30,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:30,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 28698728, now seen corresponding path program 1 times [2024-11-19 09:59:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:30,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412251707] [2024-11-19 09:59:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:30,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412251707] [2024-11-19 09:59:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412251707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:30,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403119561] [2024-11-19 09:59:30,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:30,355 INFO L87 Difference]: Start difference. First operand has 105 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 100 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:30,527 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2024-11-19 09:59:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2024-11-19 09:59:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:30,536 INFO L225 Difference]: With dead ends: 243 [2024-11-19 09:59:30,536 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 09:59:30,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:30,542 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:30,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 266 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:59:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 09:59:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2024-11-19 09:59:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.518987341772152) internal successors, (120), 106 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-19 09:59:30,583 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 5 [2024-11-19 09:59:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-19 09:59:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-19 09:59:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:59:30,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:30,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-19 09:59:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:59:30,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:30,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:30,586 INFO L85 PathProgramCache]: Analyzing trace with hash -363792156, now seen corresponding path program 1 times [2024-11-19 09:59:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:30,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987500966] [2024-11-19 09:59:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987500966] [2024-11-19 09:59:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987500966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631830024] [2024-11-19 09:59:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:30,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:30,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:30,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:30,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:59:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:30,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:59:30,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:30,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:59:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631830024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:59:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 09:59:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361667395] [2024-11-19 09:59:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:30,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:59:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:59:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:59:30,884 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:31,005 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2024-11-19 09:59:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:59:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) Word has length 9 [2024-11-19 09:59:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:31,010 INFO L225 Difference]: With dead ends: 138 [2024-11-19 09:59:31,010 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 09:59:31,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:59:31,012 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 34 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:31,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 282 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:59:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 09:59:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2024-11-19 09:59:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 105 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2024-11-19 09:59:31,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 9 [2024-11-19 09:59:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2024-11-19 09:59:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2024-11-19 09:59:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 09:59:31,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:31,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-19 09:59:31,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:59:31,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:31,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:31,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1607345098, now seen corresponding path program 1 times [2024-11-19 09:59:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378880721] [2024-11-19 09:59:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:59:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378880721] [2024-11-19 09:59:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378880721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885161090] [2024-11-19 09:59:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:31,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:31,319 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:31,411 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-11-19 09:59:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2024-11-19 09:59:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:31,414 INFO L225 Difference]: With dead ends: 137 [2024-11-19 09:59:31,414 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 09:59:31,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:31,416 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 33 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:31,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 263 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:59:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 09:59:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2024-11-19 09:59:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.513157894736842) internal successors, (115), 101 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2024-11-19 09:59:31,429 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 10 [2024-11-19 09:59:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2024-11-19 09:59:31,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2024-11-19 09:59:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:59:31,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:31,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:31,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:59:31,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:31,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1706052304, now seen corresponding path program 1 times [2024-11-19 09:59:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:31,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128733048] [2024-11-19 09:59:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128733048] [2024-11-19 09:59:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128733048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895065672] [2024-11-19 09:59:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:31,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:31,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:59:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:31,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:59:31,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:31,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895065672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:31,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:59:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 09:59:31,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32437180] [2024-11-19 09:59:31,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:31,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:59:31,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:59:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:59:31,657 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:31,770 INFO L93 Difference]: Finished difference Result 240 states and 277 transitions. [2024-11-19 09:59:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:59:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 13 [2024-11-19 09:59:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:31,771 INFO L225 Difference]: With dead ends: 240 [2024-11-19 09:59:31,772 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 09:59:31,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:59:31,774 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 134 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:31,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 378 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:59:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 09:59:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2024-11-19 09:59:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 109 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-19 09:59:31,790 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 13 [2024-11-19 09:59:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:31,790 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-19 09:59:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-19 09:59:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 09:59:31,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:31,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:31,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:59:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 09:59:31,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1610268712, now seen corresponding path program 2 times [2024-11-19 09:59:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:31,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918581542] [2024-11-19 09:59:31,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:32,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:59:32,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918581542] [2024-11-19 09:59:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918581542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236920200] [2024-11-19 09:59:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:32,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:32,061 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:32,099 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2024-11-19 09:59:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 21 [2024-11-19 09:59:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:32,100 INFO L225 Difference]: With dead ends: 229 [2024-11-19 09:59:32,101 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 09:59:32,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:32,102 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:32,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 297 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 09:59:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 119. [2024-11-19 09:59:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 114 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:59:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-11-19 09:59:32,114 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 21 [2024-11-19 09:59:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:32,114 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-11-19 09:59:32,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-11-19 09:59:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:59:32,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:32,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:32,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:59:32,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1592828572, now seen corresponding path program 1 times [2024-11-19 09:59:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:32,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609682078] [2024-11-19 09:59:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:32,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:32,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609682078] [2024-11-19 09:59:32,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609682078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:32,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:59:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990464987] [2024-11-19 09:59:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:32,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:32,233 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:32,267 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2024-11-19 09:59:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 22 [2024-11-19 09:59:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:32,270 INFO L225 Difference]: With dead ends: 221 [2024-11-19 09:59:32,270 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 09:59:32,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:32,271 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:32,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 173 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 09:59:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-19 09:59:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 108 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2024-11-19 09:59:32,281 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 22 [2024-11-19 09:59:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:32,281 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2024-11-19 09:59:32,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2024-11-19 09:59:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 09:59:32,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:32,282 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:32,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:59:32,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:32,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1727999780, now seen corresponding path program 1 times [2024-11-19 09:59:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297472753] [2024-11-19 09:59:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:59:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297472753] [2024-11-19 09:59:32,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297472753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:32,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339984020] [2024-11-19 09:59:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:32,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:32,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:59:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:32,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:59:32,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:59:32,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:59:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339984020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:32,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:59:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-19 09:59:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663181207] [2024-11-19 09:59:32,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:32,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:59:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:59:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:59:32,711 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:32,845 INFO L93 Difference]: Finished difference Result 243 states and 286 transitions. [2024-11-19 09:59:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:59:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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) Word has length 25 [2024-11-19 09:59:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:32,848 INFO L225 Difference]: With dead ends: 243 [2024-11-19 09:59:32,848 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 09:59:32,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:59:32,849 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:32,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 485 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:59:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 09:59:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2024-11-19 09:59:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 124 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-19 09:59:32,866 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 25 [2024-11-19 09:59:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-19 09:59:32,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-19 09:59:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 09:59:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:32,871 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:32,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:59:33,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:33,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:33,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1589025516, now seen corresponding path program 2 times [2024-11-19 09:59:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:33,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094732651] [2024-11-19 09:59:33,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:33,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:33,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 09:59:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094732651] [2024-11-19 09:59:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094732651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442710497] [2024-11-19 09:59:33,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:33,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:33,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:33,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:33,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:59:33,280 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:33,280 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:33,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:59:33,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:59:33,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:59:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442710497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:33,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:59:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2024-11-19 09:59:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917667843] [2024-11-19 09:59:33,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 09:59:33,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:33,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 09:59:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 09:59:33,903 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:34,203 INFO L93 Difference]: Finished difference Result 325 states and 382 transitions. [2024-11-19 09:59:34,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-19 09:59:34,204 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 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) Word has length 41 [2024-11-19 09:59:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:34,206 INFO L225 Difference]: With dead ends: 325 [2024-11-19 09:59:34,206 INFO L226 Difference]: Without dead ends: 228 [2024-11-19 09:59:34,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 09:59:34,207 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 121 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:34,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 659 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:59:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-19 09:59:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 159. [2024-11-19 09:59:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 155 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2024-11-19 09:59:34,218 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 41 [2024-11-19 09:59:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:34,219 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2024-11-19 09:59:34,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.361111111111111) internal successors, (85), 36 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2024-11-19 09:59:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:59:34,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:34,224 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:34,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:59:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:34,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:34,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash -3805708, now seen corresponding path program 1 times [2024-11-19 09:59:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5541247] [2024-11-19 09:59:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-19 09:59:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:34,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5541247] [2024-11-19 09:59:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5541247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:34,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175647978] [2024-11-19 09:59:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:34,512 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:34,536 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-19 09:59:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 74 [2024-11-19 09:59:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:34,538 INFO L225 Difference]: With dead ends: 160 [2024-11-19 09:59:34,538 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 09:59:34,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:34,539 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:34,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 195 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 09:59:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-19 09:59:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 151 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2024-11-19 09:59:34,548 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 74 [2024-11-19 09:59:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2024-11-19 09:59:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2024-11-19 09:59:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 09:59:34,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:34,552 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:34,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:59:34,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1055949087, now seen corresponding path program 1 times [2024-11-19 09:59:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031836424] [2024-11-19 09:59:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:34,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 09:59:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031836424] [2024-11-19 09:59:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031836424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188419487] [2024-11-19 09:59:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:34,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:59:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:34,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:59:34,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:59:35,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:59:36,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188419487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:36,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:59:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2024-11-19 09:59:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657596532] [2024-11-19 09:59:36,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:36,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-19 09:59:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-19 09:59:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-11-19 09:59:36,425 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 67 states, 67 states have (on average 2.283582089552239) internal successors, (153), 67 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:36,798 INFO L93 Difference]: Finished difference Result 385 states and 450 transitions. [2024-11-19 09:59:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-19 09:59:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.283582089552239) internal successors, (153), 67 states have internal predecessors, (153), 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) Word has length 77 [2024-11-19 09:59:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:36,800 INFO L225 Difference]: With dead ends: 385 [2024-11-19 09:59:36,800 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 09:59:36,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1099, Invalid=3457, Unknown=0, NotChecked=0, Total=4556 [2024-11-19 09:59:36,803 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 305 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:36,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 677 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 09:59:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 09:59:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 223. [2024-11-19 09:59:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 202 states have (on average 1.1732673267326732) internal successors, (237), 219 states have internal predecessors, (237), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 241 transitions. [2024-11-19 09:59:36,813 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 241 transitions. Word has length 77 [2024-11-19 09:59:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:36,813 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 241 transitions. [2024-11-19 09:59:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.283582089552239) internal successors, (153), 67 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 241 transitions. [2024-11-19 09:59:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 09:59:36,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:36,818 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:36,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:59:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 09:59:37,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:37,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2043028443, now seen corresponding path program 2 times [2024-11-19 09:59:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86397183] [2024-11-19 09:59:37,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:37,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:59:37,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1897 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2024-11-19 09:59:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86397183] [2024-11-19 09:59:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86397183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:37,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771833] [2024-11-19 09:59:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:37,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,098 INFO L87 Difference]: Start difference. First operand 223 states and 241 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:37,125 INFO L93 Difference]: Finished difference Result 237 states and 261 transitions. [2024-11-19 09:59:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) Word has length 145 [2024-11-19 09:59:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:37,127 INFO L225 Difference]: With dead ends: 237 [2024-11-19 09:59:37,127 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 09:59:37,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,128 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:37,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 09:59:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-11-19 09:59:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 212 states have (on average 1.1839622641509433) internal successors, (251), 229 states have internal predecessors, (251), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 255 transitions. [2024-11-19 09:59:37,138 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 255 transitions. Word has length 145 [2024-11-19 09:59:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:37,138 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 255 transitions. [2024-11-19 09:59:37,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 255 transitions. [2024-11-19 09:59:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 09:59:37,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:37,140 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:37,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:59:37,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:37,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:37,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1092166742, now seen corresponding path program 1 times [2024-11-19 09:59:37,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:37,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272181515] [2024-11-19 09:59:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1897 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2024-11-19 09:59:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272181515] [2024-11-19 09:59:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272181515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:37,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:37,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:59:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065003970] [2024-11-19 09:59:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:37,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,310 INFO L87 Difference]: Start difference. First operand 233 states and 255 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:37,324 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2024-11-19 09:59:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 146 [2024-11-19 09:59:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:37,325 INFO L225 Difference]: With dead ends: 311 [2024-11-19 09:59:37,325 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 09:59:37,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,326 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:37,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 09:59:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-19 09:59:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 216 states have (on average 1.1805555555555556) internal successors, (255), 233 states have internal predecessors, (255), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:59:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2024-11-19 09:59:37,333 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 146 [2024-11-19 09:59:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:37,334 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2024-11-19 09:59:37,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2024-11-19 09:59:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 09:59:37,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:37,335 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:37,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:59:37,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:37,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1090677192, now seen corresponding path program 1 times [2024-11-19 09:59:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463701759] [2024-11-19 09:59:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1897 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2024-11-19 09:59:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:37,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463701759] [2024-11-19 09:59:37,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463701759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:37,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:37,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:59:37,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059811319] [2024-11-19 09:59:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:37,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,570 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:37,587 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2024-11-19 09:59:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 146 [2024-11-19 09:59:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:37,590 INFO L225 Difference]: With dead ends: 249 [2024-11-19 09:59:37,590 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 09:59:37,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:59:37,591 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:37,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 09:59:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-19 09:59:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 151 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2024-11-19 09:59:37,598 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 146 [2024-11-19 09:59:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2024-11-19 09:59:37,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2024-11-19 09:59:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-19 09:59:37,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:37,600 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:59:37,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1940610040, now seen corresponding path program 1 times [2024-11-19 09:59:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460477340] [2024-11-19 09:59:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:37,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1897 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1897 trivial. 0 not checked. [2024-11-19 09:59:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460477340] [2024-11-19 09:59:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460477340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:59:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501943555] [2024-11-19 09:59:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:59:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:59:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,762 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:37,785 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2024-11-19 09:59:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:59:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 149 [2024-11-19 09:59:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:37,786 INFO L225 Difference]: With dead ends: 164 [2024-11-19 09:59:37,786 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 09:59:37,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:59:37,787 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:37,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:59:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 09:59:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 09:59:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.025) internal successors, (164), 161 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2024-11-19 09:59:37,793 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 149 [2024-11-19 09:59:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:37,794 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2024-11-19 09:59:37,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2024-11-19 09:59:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 09:59:37,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:37,795 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:59:37,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash -161098454, now seen corresponding path program 1 times [2024-11-19 09:59:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817588652] [2024-11-19 09:59:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817588652] [2024-11-19 09:59:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817588652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038675035] [2024-11-19 09:59:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:40,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:40,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:40,427 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:40,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:59:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:40,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-19 09:59:40,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:40,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1906 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038675035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:43,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:59:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2024-11-19 09:59:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583231662] [2024-11-19 09:59:43,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2024-11-19 09:59:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:59:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2024-11-19 09:59:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2024-11-19 09:59:43,700 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand has 130 states, 130 states have (on average 2.1384615384615384) internal successors, (278), 130 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:59:44,094 INFO L93 Difference]: Finished difference Result 325 states and 360 transitions. [2024-11-19 09:59:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-11-19 09:59:44,095 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 2.1384615384615384) internal successors, (278), 130 states have internal predecessors, (278), 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) Word has length 159 [2024-11-19 09:59:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:59:44,096 INFO L225 Difference]: With dead ends: 325 [2024-11-19 09:59:44,096 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 09:59:44,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2024-11-19 09:59:44,101 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:59:44,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 09:59:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 09:59:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-19 09:59:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 1.0138888888888888) internal successors, (292), 289 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 292 transitions. [2024-11-19 09:59:44,109 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 292 transitions. Word has length 159 [2024-11-19 09:59:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:59:44,109 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 292 transitions. [2024-11-19 09:59:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 2.1384615384615384) internal successors, (278), 130 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 292 transitions. [2024-11-19 09:59:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-19 09:59:44,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:59:44,112 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:44,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 09:59:44,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 09:59:44,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 09:59:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1449747626, now seen corresponding path program 2 times [2024-11-19 09:59:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:59:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081555165] [2024-11-19 09:59:44,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:59:44,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:44,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7881 trivial. 0 not checked. [2024-11-19 09:59:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:59:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081555165] [2024-11-19 09:59:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081555165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:59:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816910662] [2024-11-19 09:59:44,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:44,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:59:44,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:59:44,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:59:44,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:59:44,911 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:44,911 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:44,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-19 09:59:44,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 09:59:49,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:00:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7890 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:00:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816910662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:00:00,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:00:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 129, 129] total 260 [2024-11-19 10:00:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521988231] [2024-11-19 10:00:00,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:00:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 260 states [2024-11-19 10:00:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 260 interpolants. [2024-11-19 10:00:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16520, Invalid=50820, Unknown=0, NotChecked=0, Total=67340 [2024-11-19 10:00:00,733 INFO L87 Difference]: Start difference. First operand 290 states and 292 transitions. Second operand has 260 states, 260 states have (on average 2.1653846153846152) internal successors, (563), 260 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:01,870 INFO L93 Difference]: Finished difference Result 580 states and 648 transitions. [2024-11-19 10:00:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2024-11-19 10:00:01,871 INFO L78 Accepts]: Start accepts. Automaton has has 260 states, 260 states have (on average 2.1653846153846152) internal successors, (563), 260 states have internal predecessors, (563), 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) Word has length 287 [2024-11-19 10:00:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:01,874 INFO L225 Difference]: With dead ends: 580 [2024-11-19 10:00:01,874 INFO L226 Difference]: Without dead ends: 545 [2024-11-19 10:00:01,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19906 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=16782, Invalid=51600, Unknown=0, NotChecked=0, Total=68382 [2024-11-19 10:00:01,879 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:01,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 311 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:00:01,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-19 10:00:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2024-11-19 10:00:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.005514705882353) internal successors, (547), 544 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 547 transitions. [2024-11-19 10:00:01,893 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 547 transitions. Word has length 287 [2024-11-19 10:00:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:01,894 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 547 transitions. [2024-11-19 10:00:01,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 260 states, 260 states have (on average 2.1653846153846152) internal successors, (563), 260 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 547 transitions. [2024-11-19 10:00:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-11-19 10:00:01,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:00:01,902 INFO L215 NwaCegarLoop]: trace histogram [127, 127, 127, 127, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:01,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 10:00:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:00:02,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-11-19 10:00:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:00:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 67629660, now seen corresponding path program 1 times [2024-11-19 10:00:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:00:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689885025] [2024-11-19 10:00:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:00:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:00:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:00:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32147 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 32138 trivial. 0 not checked. [2024-11-19 10:00:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:00:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689885025] [2024-11-19 10:00:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689885025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:00:02,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:00:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:00:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136416344] [2024-11-19 10:00:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:00:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:00:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:00:02,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:00:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:02,534 INFO L87 Difference]: Start difference. First operand 545 states and 547 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:00:02,562 INFO L93 Difference]: Finished difference Result 545 states and 547 transitions. [2024-11-19 10:00:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:00:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) Word has length 544 [2024-11-19 10:00:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:00:02,564 INFO L225 Difference]: With dead ends: 545 [2024-11-19 10:00:02,564 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:00:02,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:00:02,565 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:00:02,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:00:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:00:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:00:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:00:02,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 544 [2024-11-19 10:00:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:00:02,567 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:00:02,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:00:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:00:02,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:00:02,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2024-11-19 10:00:02,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2024-11-19 10:00:02,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2024-11-19 10:00:02,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2024-11-19 10:00:02,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2024-11-19 10:00:02,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2024-11-19 10:00:02,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2024-11-19 10:00:02,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2024-11-19 10:00:02,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2024-11-19 10:00:02,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2024-11-19 10:00:02,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2024-11-19 10:00:02,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2024-11-19 10:00:02,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2024-11-19 10:00:02,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2024-11-19 10:00:02,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2024-11-19 10:00:02,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2024-11-19 10:00:02,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2024-11-19 10:00:02,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2024-11-19 10:00:02,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2024-11-19 10:00:02,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:00:02,579 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:00:02,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:00:03,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:00:03,817 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2024-11-19 10:00:03,818 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2024-11-19 10:00:03,818 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2024-11-19 10:00:03,818 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2024-11-19 10:00:03,818 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2024-11-19 10:00:03,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:00:03 BoogieIcfgContainer [2024-11-19 10:00:03,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:00:03,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:00:03,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:00:03,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:00:03,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:29" (3/4) ... [2024-11-19 10:00:03,830 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:00:03,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 10:00:03,842 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 10:00:03,843 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 10:00:03,843 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:00:03,843 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:00:03,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:00:03,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:00:03,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:00:03,958 INFO L158 Benchmark]: Toolchain (without parser) took 34939.12ms. Allocated memory was 161.5MB in the beginning and 450.9MB in the end (delta: 289.4MB). Free memory was 105.4MB in the beginning and 242.7MB in the end (delta: -137.4MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,958 INFO L158 Benchmark]: CDTParser took 1.81ms. Allocated memory is still 161.5MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:00:03,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.67ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 91.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.21ms. Allocated memory is still 161.5MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,959 INFO L158 Benchmark]: Boogie Preprocessor took 72.46ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 86.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,959 INFO L158 Benchmark]: RCFGBuilder took 490.09ms. Allocated memory is still 161.5MB. Free memory was 86.9MB in the beginning and 66.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,959 INFO L158 Benchmark]: TraceAbstraction took 33855.86ms. Allocated memory was 161.5MB in the beginning and 450.9MB in the end (delta: 289.4MB). Free memory was 130.2MB in the beginning and 250.1MB in the end (delta: -119.9MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,959 INFO L158 Benchmark]: Witness Printer took 130.28ms. Allocated memory is still 450.9MB. Free memory was 250.1MB in the beginning and 242.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:00:03,961 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.81ms. Allocated memory is still 161.5MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.67ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 91.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.21ms. Allocated memory is still 161.5MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.46ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 86.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.09ms. Allocated memory is still 161.5MB. Free memory was 86.9MB in the beginning and 66.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33855.86ms. Allocated memory was 161.5MB in the beginning and 450.9MB in the end (delta: 289.4MB). Free memory was 130.2MB in the beginning and 250.1MB in the end (delta: -119.9MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. * Witness Printer took 130.28ms. Allocated memory is still 450.9MB. Free memory was 250.1MB in the beginning and 242.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 * 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: 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 2 procedures, 105 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 32.5s, OverallIterations: 17, TraceHistogramMax: 127, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 864 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 4860 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3727 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2585 IncrementalHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 1133 mSDtfsCounter, 2585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1339 GetRequests, 799 SyntacticMatches, 0 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26637 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=16, InterpolantAutomatonStates: 559, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 317 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 2484 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3056 ConstructedInterpolants, 0 QuantifiedInterpolants, 5766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2230 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 48710/71249 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 28 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((1 <= v) && (n == 0)) || ((n == 0) && (v == 0))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((size == 0) && (i == 0)) || ((size == 0) && (i == 0))) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((1 <= v) && (n == 0)) || ((n == 0) && (v == 0))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((1 <= x) && (n == 0)) || ((n == 0) && (x == 0))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((n == 0) && (v == 0)) && (x == 0)) || ((((1 <= v) && (n == 0)) && (x == 0)) && (v <= 99999))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-11-19 10:00:03,997 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