./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/list-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:25:01,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:25:01,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:25:01,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:25:01,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:25:01,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:25:01,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:25:01,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:25:01,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:25:01,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:25:01,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:25:01,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:25:01,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:25:01,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:25:01,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:25:01,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:25:01,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:25:01,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:25:01,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:25:01,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:25:01,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:25:01,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:25:01,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:25:01,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:25:01,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:25:01,986 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:25:01,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:25:01,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:25:01,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:25:01,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:25:01,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:25:01,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:25:01,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:25:01,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:25:01,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:25:01,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:25:01,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:25:01,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:25:01,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:25:01,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:25:01,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:25:01,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:25:01,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:25:01,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:25:01,990 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2024-11-09 11:25:02,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:25:02,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:25:02,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:25:02,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:25:02,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:25:02,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-09 11:25:03,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:25:03,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:25:03,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-09 11:25:03,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016991d89/35a7e850a0a5496480f908230c5ff62f/FLAG3b252a8f8 [2024-11-09 11:25:03,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/016991d89/35a7e850a0a5496480f908230c5ff62f [2024-11-09 11:25:03,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:25:03,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:25:03,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:25:03,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:25:03,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:25:03,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:25:03" (1/1) ... [2024-11-09 11:25:03,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1d7a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:03, skipping insertion in model container [2024-11-09 11:25:03,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:25:03" (1/1) ... [2024-11-09 11:25:03,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:25:04,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:25:04,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:25:04,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:25:04,128 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:25:04,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04 WrapperNode [2024-11-09 11:25:04,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:25:04,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:25:04,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:25:04,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:25:04,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,182 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-09 11:25:04,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:25:04,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:25:04,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:25:04,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:25:04,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,229 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-09 11:25:04,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:25:04,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:25:04,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:25:04,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:25:04,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (1/1) ... [2024-11-09 11:25:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:25:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:04,275 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-09 11:25:04,281 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-09 11:25:04,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 11:25:04,317 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:25:04,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:25:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:25:04,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:25:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:25:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:25:04,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:25:04,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:25:04,628 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-09 11:25:04,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:25:04,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:25:04,639 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 11:25:04,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:04 BoogieIcfgContainer [2024-11-09 11:25:04,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:25:04,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:25:04,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:25:04,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:25:04,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:25:03" (1/3) ... [2024-11-09 11:25:04,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd37923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:25:04, skipping insertion in model container [2024-11-09 11:25:04,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:25:04" (2/3) ... [2024-11-09 11:25:04,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd37923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:25:04, skipping insertion in model container [2024-11-09 11:25:04,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:04" (3/3) ... [2024-11-09 11:25:04,647 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2024-11-09 11:25:04,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:25:04,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-09 11:25:04,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:25:04,714 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;@c108cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:25:04,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-09 11:25:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 69 states have internal predecessors, (85), 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-09 11:25:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:25:04,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:04,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:04,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1772426582, now seen corresponding path program 1 times [2024-11-09 11:25:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316045030] [2024-11-09 11:25:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:04,978 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-09 11:25:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316045030] [2024-11-09 11:25:04,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316045030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839199932] [2024-11-09 11:25:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:25:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:25:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:05,010 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 69 states have internal predecessors, (85), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:05,052 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2024-11-09 11:25:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:25:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 11:25:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:05,061 INFO L225 Difference]: With dead ends: 128 [2024-11-09 11:25:05,061 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:25:05,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:25:05,068 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:05,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:25:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 11:25:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.55) internal successors, (62), 57 states have internal predecessors, (62), 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-09 11:25:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-09 11:25:05,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 13 [2024-11-09 11:25:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:05,101 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-09 11:25:05,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-09 11:25:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:25:05,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:05,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:25:05,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1772724492, now seen corresponding path program 1 times [2024-11-09 11:25:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393361054] [2024-11-09 11:25:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,258 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-09 11:25:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393361054] [2024-11-09 11:25:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393361054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:05,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:05,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:05,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269819923] [2024-11-09 11:25:05,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:05,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:05,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:05,264 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:05,305 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2024-11-09 11:25:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 11:25:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:05,307 INFO L225 Difference]: With dead ends: 109 [2024-11-09 11:25:05,307 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 11:25:05,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:05,309 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:05,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 11:25:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-11-09 11:25:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 58 states have internal predecessors, (63), 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-09 11:25:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-09 11:25:05,318 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 13 [2024-11-09 11:25:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:05,319 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-09 11:25:05,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:25:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-09 11:25:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 11:25:05,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:05,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:05,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:25:05,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:05,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash -413924383, now seen corresponding path program 1 times [2024-11-09 11:25:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125412654] [2024-11-09 11:25:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125412654] [2024-11-09 11:25:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125412654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:05,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689604776] [2024-11-09 11:25:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:05,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:05,521 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:05,591 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-09 11:25:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:05,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-09 11:25:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:05,592 INFO L225 Difference]: With dead ends: 67 [2024-11-09 11:25:05,592 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 11:25:05,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:05,593 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:05,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 11:25:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-09 11:25:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 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-09 11:25:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-09 11:25:05,599 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 18 [2024-11-09 11:25:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:05,599 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-09 11:25:05,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-09 11:25:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:25:05,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:05,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:05,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:25:05,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:05,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 53246064, now seen corresponding path program 1 times [2024-11-09 11:25:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:05,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469396411] [2024-11-09 11:25:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469396411] [2024-11-09 11:25:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469396411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100077391] [2024-11-09 11:25:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:05,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:05,751 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:05,792 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-09 11:25:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:05,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 11:25:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:05,793 INFO L225 Difference]: With dead ends: 67 [2024-11-09 11:25:05,793 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 11:25:05,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:05,794 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:05,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 11:25:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 11:25:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 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-09 11:25:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-09 11:25:05,799 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2024-11-09 11:25:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:05,799 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-09 11:25:05,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-09 11:25:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:25:05,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:05,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:05,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:25:05,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash 778973566, now seen corresponding path program 1 times [2024-11-09 11:25:05,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948922262] [2024-11-09 11:25:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:05,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948922262] [2024-11-09 11:25:05,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948922262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000536645] [2024-11-09 11:25:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:05,946 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-09 11:25:05,947 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-09 11:25:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:25:06,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:06,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000536645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-11-09 11:25:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312761807] [2024-11-09 11:25:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:06,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:25:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:25:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:06,108 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:06,131 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-09 11:25:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:25:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 11:25:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:06,132 INFO L225 Difference]: With dead ends: 66 [2024-11-09 11:25:06,133 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 11:25:06,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:06,134 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:06,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 11:25:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 11:25:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 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-09 11:25:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-09 11:25:06,146 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2024-11-09 11:25:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:06,146 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-09 11:25:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-09 11:25:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:25:06,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:06,149 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:06,164 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-09 11:25:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:06,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1621623171, now seen corresponding path program 1 times [2024-11-09 11:25:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506564695] [2024-11-09 11:25:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506564695] [2024-11-09 11:25:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506564695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758693917] [2024-11-09 11:25:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:06,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:06,439 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:06,484 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-09 11:25:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 11:25:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:06,486 INFO L225 Difference]: With dead ends: 64 [2024-11-09 11:25:06,486 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 11:25:06,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 11:25:06,487 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:06,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 94 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 11:25:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 11:25:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 57 states have internal predecessors, (62), 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-09 11:25:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 11:25:06,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2024-11-09 11:25:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:06,495 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 11:25:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 11:25:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:25:06,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:06,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:25:06,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 693263263, now seen corresponding path program 1 times [2024-11-09 11:25:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052030911] [2024-11-09 11:25:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052030911] [2024-11-09 11:25:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052030911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744592087] [2024-11-09 11:25:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:06,586 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:06,643 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-11-09 11:25:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 11:25:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:06,645 INFO L225 Difference]: With dead ends: 83 [2024-11-09 11:25:06,645 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 11:25:06,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:06,646 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:06,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 108 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 11:25:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-11-09 11:25:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 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-09 11:25:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-09 11:25:06,653 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 26 [2024-11-09 11:25:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:06,653 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-09 11:25:06,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-09 11:25:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:25:06,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:06,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:25:06,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash 16324744, now seen corresponding path program 1 times [2024-11-09 11:25:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393299444] [2024-11-09 11:25:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:06,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:06,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393299444] [2024-11-09 11:25:06,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393299444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223506412] [2024-11-09 11:25:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:06,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:06,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:06,827 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-09 11:25:06,831 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-09 11:25:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:25:06,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:07,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223506412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:07,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:07,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 11:25:07,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523166266] [2024-11-09 11:25:07,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:07,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:25:07,005 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:07,057 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-09 11:25:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:07,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 11:25:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:07,059 INFO L225 Difference]: With dead ends: 85 [2024-11-09 11:25:07,059 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 11:25:07,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:25:07,061 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:07,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 93 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 11:25:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2024-11-09 11:25:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.32) internal successors, (66), 61 states have internal predecessors, (66), 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-09 11:25:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-09 11:25:07,074 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 27 [2024-11-09 11:25:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-09 11:25:07,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-09 11:25:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 11:25:07,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:07,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:07,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:07,276 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,SelfDestructingSolverStorable7 [2024-11-09 11:25:07,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:07,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash 181155735, now seen corresponding path program 1 times [2024-11-09 11:25:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:07,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833647778] [2024-11-09 11:25:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:25:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:25:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833647778] [2024-11-09 11:25:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833647778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:07,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345193103] [2024-11-09 11:25:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:07,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:07,372 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:07,407 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-09 11:25:07,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:07,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 11:25:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:07,408 INFO L225 Difference]: With dead ends: 66 [2024-11-09 11:25:07,408 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 11:25:07,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:07,408 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:07,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 11:25:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 11:25:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 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-09 11:25:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-09 11:25:07,414 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2024-11-09 11:25:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:07,414 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-09 11:25:07,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-09 11:25:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:25:07,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:07,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:07,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:25:07,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1320860538, now seen corresponding path program 1 times [2024-11-09 11:25:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482949932] [2024-11-09 11:25:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:25:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:25:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482949932] [2024-11-09 11:25:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482949932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245519249] [2024-11-09 11:25:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:07,523 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-09 11:25:07,524 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-09 11:25:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:25:07,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:07,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245519249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:07,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:07,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-09 11:25:07,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034083557] [2024-11-09 11:25:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:07,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:07,682 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:07,698 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-09 11:25:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-09 11:25:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:07,700 INFO L225 Difference]: With dead ends: 116 [2024-11-09 11:25:07,700 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 11:25:07,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:07,700 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:07,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 11:25:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 11:25:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 56 states have internal predecessors, (60), 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-09 11:25:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-09 11:25:07,705 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2024-11-09 11:25:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:07,705 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-09 11:25:07,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-09 11:25:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:25:07,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:07,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:07,721 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-09 11:25:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:07,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1491787638, now seen corresponding path program 1 times [2024-11-09 11:25:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896206139] [2024-11-09 11:25:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:07,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896206139] [2024-11-09 11:25:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896206139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146970134] [2024-11-09 11:25:07,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:07,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:07,994 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:08,016 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-09 11:25:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:08,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 11:25:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:08,017 INFO L225 Difference]: With dead ends: 60 [2024-11-09 11:25:08,017 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 11:25:08,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 11:25:08,018 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:08,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 11:25:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 11:25:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 55 states have internal predecessors, (59), 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-09 11:25:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-11-09 11:25:08,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2024-11-09 11:25:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:08,022 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-11-09 11:25:08,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-09 11:25:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 11:25:08,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:08,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:25:08,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:08,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 999223562, now seen corresponding path program 1 times [2024-11-09 11:25:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041560844] [2024-11-09 11:25:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041560844] [2024-11-09 11:25:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041560844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326284523] [2024-11-09 11:25:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:08,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:08,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:08,140 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-09 11:25:08,141 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-09 11:25:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:25:08,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:08,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326284523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:08,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:08,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2024-11-09 11:25:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987661596] [2024-11-09 11:25:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:08,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:25:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:25:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:25:08,271 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:08,340 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-09 11:25:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:25:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 11:25:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:08,341 INFO L225 Difference]: With dead ends: 75 [2024-11-09 11:25:08,341 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 11:25:08,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:08,342 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:08,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 160 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 11:25:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-11-09 11:25:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.26) internal successors, (63), 58 states have internal predecessors, (63), 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-09 11:25:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-09 11:25:08,349 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2024-11-09 11:25:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:08,350 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-09 11:25:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-09 11:25:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:25:08,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:08,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:08,369 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-09 11:25:08,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:08,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:08,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1820490806, now seen corresponding path program 1 times [2024-11-09 11:25:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:08,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394056678] [2024-11-09 11:25:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:08,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:08,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394056678] [2024-11-09 11:25:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394056678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881371554] [2024-11-09 11:25:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:08,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:08,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:08,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:08,634 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:08,676 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-09 11:25:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 11:25:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:08,676 INFO L225 Difference]: With dead ends: 62 [2024-11-09 11:25:08,677 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:25:08,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:08,677 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:08,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 142 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:25:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 11:25:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.24) internal successors, (62), 57 states have internal predecessors, (62), 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-09 11:25:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-09 11:25:08,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 32 [2024-11-09 11:25:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:08,681 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-09 11:25:08,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-09 11:25:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:25:08,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:08,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:25:08,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:08,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash -600640042, now seen corresponding path program 1 times [2024-11-09 11:25:08,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:08,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142197630] [2024-11-09 11:25:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142197630] [2024-11-09 11:25:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142197630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257576901] [2024-11-09 11:25:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:08,793 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-09 11:25:08,794 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-09 11:25:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:08,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:08,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257576901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-09 11:25:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662543552] [2024-11-09 11:25:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:08,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:08,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:25:08,990 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:09,047 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-09 11:25:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-09 11:25:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:09,048 INFO L225 Difference]: With dead ends: 110 [2024-11-09 11:25:09,048 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 11:25:09,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:25:09,049 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 124 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 11:25:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-11-09 11:25:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 58 states have internal predecessors, (63), 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-09 11:25:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-09 11:25:09,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 33 [2024-11-09 11:25:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:09,053 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-09 11:25:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-09 11:25:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:25:09,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:09,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:09,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:09,254 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,SelfDestructingSolverStorable13 [2024-11-09 11:25:09,255 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:09,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 837870808, now seen corresponding path program 1 times [2024-11-09 11:25:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:09,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668803623] [2024-11-09 11:25:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:25:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:09,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668803623] [2024-11-09 11:25:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668803623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:25:09,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620194978] [2024-11-09 11:25:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:09,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:25:09,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:09,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:25:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:25:09,331 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:09,394 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-11-09 11:25:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:25:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-09 11:25:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:09,395 INFO L225 Difference]: With dead ends: 71 [2024-11-09 11:25:09,395 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 11:25:09,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:09,395 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:09,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 160 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 11:25:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2024-11-09 11:25:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 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-09 11:25:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-09 11:25:09,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2024-11-09 11:25:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:09,399 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-09 11:25:09,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-09 11:25:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:25:09,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:09,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:09,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:25:09,400 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 591030053, now seen corresponding path program 1 times [2024-11-09 11:25:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903232157] [2024-11-09 11:25:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:25:09,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903232157] [2024-11-09 11:25:09,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903232157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:09,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398480847] [2024-11-09 11:25:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:09,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:09,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:09,596 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-09 11:25:09,599 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-09 11:25:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:25:09,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:25:09,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:25:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398480847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:09,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 12 [2024-11-09 11:25:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458391239] [2024-11-09 11:25:09,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:25:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:25:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:25:09,843 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:10,033 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-09 11:25:10,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 11:25:10,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-11-09 11:25:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:10,034 INFO L225 Difference]: With dead ends: 103 [2024-11-09 11:25:10,034 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 11:25:10,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:25:10,034 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:10,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 265 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 11:25:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-11-09 11:25:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.163265306122449) internal successors, (57), 53 states have internal predecessors, (57), 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-09 11:25:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-09 11:25:10,039 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 42 [2024-11-09 11:25:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:10,039 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-09 11:25:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-09 11:25:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 11:25:10,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:10,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:10,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:10,240 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,SelfDestructingSolverStorable15 [2024-11-09 11:25:10,240 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1134610472, now seen corresponding path program 1 times [2024-11-09 11:25:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470836893] [2024-11-09 11:25:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:25:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470836893] [2024-11-09 11:25:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470836893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:25:10,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223943965] [2024-11-09 11:25:10,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:10,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:25:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:25:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:25:10,335 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:10,360 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-09 11:25:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:25:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-09 11:25:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:10,361 INFO L225 Difference]: With dead ends: 57 [2024-11-09 11:25:10,361 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 11:25:10,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 11:25:10,362 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:10,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 131 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 11:25:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 11:25:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 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-09 11:25:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-11-09 11:25:10,366 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 44 [2024-11-09 11:25:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-11-09 11:25:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-11-09 11:25:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 11:25:10,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:10,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:10,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:25:10,368 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:10,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash 813186392, now seen corresponding path program 1 times [2024-11-09 11:25:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631791854] [2024-11-09 11:25:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631791854] [2024-11-09 11:25:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631791854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045088079] [2024-11-09 11:25:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:10,476 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-09 11:25:10,477 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-09 11:25:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:10,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:10,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:25:10,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:25:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045088079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:10,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-11-09 11:25:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097816746] [2024-11-09 11:25:10,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:10,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:25:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:25:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:10,706 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:10,810 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-09 11:25:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:25:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-11-09 11:25:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:10,811 INFO L225 Difference]: With dead ends: 91 [2024-11-09 11:25:10,811 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 11:25:10,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:10,812 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 82 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:10,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 178 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 11:25:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-11-09 11:25:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 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-09 11:25:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-09 11:25:10,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 45 [2024-11-09 11:25:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:10,819 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-09 11:25:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-09 11:25:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:25:10,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:10,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:10,834 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-09 11:25:11,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:11,025 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash 878874549, now seen corresponding path program 2 times [2024-11-09 11:25:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121863478] [2024-11-09 11:25:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:25:11,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121863478] [2024-11-09 11:25:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121863478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176657862] [2024-11-09 11:25:11,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:11,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:11,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:25:11,298 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:25:11,298 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:11,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:25:11,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 11:25:11,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176657862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-09 11:25:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636246206] [2024-11-09 11:25:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:11,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:25:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:11,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:25:11,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:11,355 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:11,419 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-09 11:25:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:25:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-09 11:25:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:11,420 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:25:11,420 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 11:25:11,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:25:11,421 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:11,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 11:25:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-11-09 11:25:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 61 states have internal predecessors, (66), 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-09 11:25:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2024-11-09 11:25:11,427 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 54 [2024-11-09 11:25:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:11,428 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2024-11-09 11:25:11,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2024-11-09 11:25:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 11:25:11,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:11,428 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:11,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:11,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:11,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 379652506, now seen corresponding path program 1 times [2024-11-09 11:25:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:11,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997136953] [2024-11-09 11:25:11,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:25:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997136953] [2024-11-09 11:25:11,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997136953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:11,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407978714] [2024-11-09 11:25:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:11,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:11,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:11,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:25:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:11,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:11,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 11:25:11,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407978714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-09 11:25:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449539270] [2024-11-09 11:25:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:11,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:25:11,958 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:12,005 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-09 11:25:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:12,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-09 11:25:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:12,007 INFO L225 Difference]: With dead ends: 86 [2024-11-09 11:25:12,007 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 11:25:12,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:25:12,007 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:12,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 11:25:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-11-09 11:25:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 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-09 11:25:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-09 11:25:12,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 57 [2024-11-09 11:25:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:12,013 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-09 11:25:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-09 11:25:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 11:25:12,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:12,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:12,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:25:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:12,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:12,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1133145242, now seen corresponding path program 1 times [2024-11-09 11:25:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162554664] [2024-11-09 11:25:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 11:25:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162554664] [2024-11-09 11:25:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162554664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148452284] [2024-11-09 11:25:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:12,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:12,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:12,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:25:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:25:12,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:25:12,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148452284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-09 11:25:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194167152] [2024-11-09 11:25:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:12,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:25:12,556 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:12,602 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-09 11:25:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-09 11:25:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:12,604 INFO L225 Difference]: With dead ends: 73 [2024-11-09 11:25:12,604 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 11:25:12,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:25:12,604 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:12,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 107 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 11:25:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-09 11:25:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.125) internal successors, (72), 67 states have internal predecessors, (72), 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-09 11:25:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-11-09 11:25:12,610 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 60 [2024-11-09 11:25:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:12,610 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-11-09 11:25:12,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-11-09 11:25:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 11:25:12,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:12,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:12,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:25:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 11:25:12,812 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash -767763989, now seen corresponding path program 1 times [2024-11-09 11:25:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666625621] [2024-11-09 11:25:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 11:25:12,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:12,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666625621] [2024-11-09 11:25:12,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666625621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:12,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895664750] [2024-11-09 11:25:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:12,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:12,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:25:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:25:13,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:25:13,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:13,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895664750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:13,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:13,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-11-09 11:25:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423342791] [2024-11-09 11:25:13,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:13,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:13,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:25:13,177 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:13,220 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-09 11:25:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:13,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-11-09 11:25:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:13,222 INFO L225 Difference]: With dead ends: 71 [2024-11-09 11:25:13,222 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 11:25:13,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:25:13,223 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:13,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 97 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 11:25:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 11:25:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 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-09 11:25:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-09 11:25:13,238 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 61 [2024-11-09 11:25:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-09 11:25:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-09 11:25:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:25:13,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:13,239 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:13,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:13,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 11:25:13,440 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1331236232, now seen corresponding path program 1 times [2024-11-09 11:25:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174621355] [2024-11-09 11:25:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:25:13,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174621355] [2024-11-09 11:25:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174621355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:13,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487903752] [2024-11-09 11:25:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:13,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 11:25:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:25:13,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:25:13,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 11:25:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487903752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:13,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-11-09 11:25:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511699640] [2024-11-09 11:25:13,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:25:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:25:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:25:13,878 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:13,972 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-09 11:25:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:25:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2024-11-09 11:25:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:13,973 INFO L225 Difference]: With dead ends: 80 [2024-11-09 11:25:13,973 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 11:25:13,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:13,974 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:13,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 223 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 11:25:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 11:25:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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-09 11:25:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-11-09 11:25:13,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 67 [2024-11-09 11:25:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:13,978 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-11-09 11:25:13,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:25:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-11-09 11:25:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 11:25:13,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:13,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:13,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 11:25:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 11:25:14,179 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-09 11:25:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 818023415, now seen corresponding path program 1 times [2024-11-09 11:25:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233024346] [2024-11-09 11:25:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 11:25:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233024346] [2024-11-09 11:25:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233024346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:25:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:25:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542235669] [2024-11-09 11:25:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:25:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:25:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:14,254 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:14,302 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-11-09 11:25:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:25:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-11-09 11:25:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:14,302 INFO L225 Difference]: With dead ends: 66 [2024-11-09 11:25:14,302 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:25:14,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:25:14,303 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:14,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:25:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:25:14,303 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-09 11:25:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:25:14,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-11-09 11:25:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:14,304 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:25:14,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:25:14,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:25:14,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-11-09 11:25:14,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-11-09 11:25:14,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-11-09 11:25:14,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-11-09 11:25:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-11-09 11:25:14,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 11:25:14,313 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:14,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:25:14,421 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:25:14,439 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:14,439 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:14,439 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:14,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:14,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:14,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:14,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:14,440 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:14,445 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-09 11:25:14,453 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 11:25:14,456 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 11:25:14,456 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 11:25:14,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:25:14 BoogieIcfgContainer [2024-11-09 11:25:14,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:25:14,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:25:14,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:25:14,458 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:25:14,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:25:04" (3/4) ... [2024-11-09 11:25:14,461 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:25:14,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-09 11:25:14,469 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 11:25:14,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 11:25:14,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:25:14,470 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:25:14,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:25:14,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:25:14,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:25:14,561 INFO L158 Benchmark]: Toolchain (without parser) took 10790.24ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 90.5MB in the beginning and 187.0MB in the end (delta: -96.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:25:14,561 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 109.1MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:25:14,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.24ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 70.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 131.3MB in the end (delta: -61.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,562 INFO L158 Benchmark]: Boogie Preprocessor took 57.33ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 128.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,562 INFO L158 Benchmark]: RCFGBuilder took 398.29ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 108.5MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,562 INFO L158 Benchmark]: TraceAbstraction took 9816.89ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 107.9MB in the beginning and 193.2MB in the end (delta: -85.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,562 INFO L158 Benchmark]: Witness Printer took 102.44ms. Allocated memory is still 245.4MB. Free memory was 193.2MB in the beginning and 187.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:25:14,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 109.1MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.24ms. Allocated memory is still 159.4MB. Free memory was 90.3MB in the beginning and 70.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 159.4MB. Free memory was 70.2MB in the beginning and 131.3MB in the end (delta: -61.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.33ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 128.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 398.29ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 108.5MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9816.89ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 107.9MB in the beginning and 193.2MB in the end (delta: -85.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 102.44ms. Allocated memory is still 245.4MB. Free memory was 193.2MB in the beginning and 187.0MB in the end (delta: 6.2MB). 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: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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, 73 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 3579 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2472 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1107 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 746 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 83 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1408 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1523 ConstructedInterpolants, 0 QuantifiedInterpolants, 4155 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3261 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 463/489 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 18 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 2)) || ((len == 1) && (len == 2))) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((index <= 1) || (index == 0)) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((index <= 0) || (index <= 1)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:25:14,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE