./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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-ext-properties/test-0232_1-1.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 b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:56:16,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:56:16,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:56:16,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:56:16,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:56:16,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:56:16,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:56:16,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:56:16,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:56:16,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:56:16,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:56:16,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:56:16,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:56:16,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:56:16,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:56:16,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:56:16,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:56:16,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:56:16,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:56:16,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:56:16,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:56:16,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:56:16,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:56:16,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:56:16,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:56:16,606 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:56:16,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:56:16,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:56:16,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:56:16,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:56:16,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:56:16,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:56:16,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:56:16,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:56:16,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:56:16,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:56:16,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:56:16,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:56:16,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:56:16,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:56:16,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:56:16,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:56:16,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:56:16,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:56:16,612 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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2024-11-12 16:56:16,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:56:16,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:56:16,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:56:16,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:56:16,903 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:56:16,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-11-12 16:56:18,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:56:18,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:56:18,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-11-12 16:56:18,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33230269b/ab6933e8303e4381aa0e1a7eb2bdcdd3/FLAGd03df22a8 [2024-11-12 16:56:18,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33230269b/ab6933e8303e4381aa0e1a7eb2bdcdd3 [2024-11-12 16:56:18,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:56:18,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:56:18,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:56:18,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:56:18,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:56:18,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:18" (1/1) ... [2024-11-12 16:56:18,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cb7c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:18, skipping insertion in model container [2024-11-12 16:56:18,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:18" (1/1) ... [2024-11-12 16:56:18,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:56:19,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:56:19,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:56:19,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:56:19,116 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:56:19,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19 WrapperNode [2024-11-12 16:56:19,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:56:19,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:56:19,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:56:19,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:56:19,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,159 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-12 16:56:19,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:56:19,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:56:19,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:56:19,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:56:19,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,189 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-11-12 16:56:19,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:56:19,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:56:19,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:56:19,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:56:19,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (1/1) ... [2024-11-12 16:56:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:56:19,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:19,251 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-12 16:56:19,255 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-12 16:56:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:56:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:56:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 16:56:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 16:56:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 16:56:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 16:56:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 16:56:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 16:56:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 16:56:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 16:56:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:56:19,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:56:19,431 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:56:19,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:56:19,638 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-12 16:56:19,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:56:19,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:56:19,656 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:56:19,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:19 BoogieIcfgContainer [2024-11-12 16:56:19,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:56:19,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:56:19,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:56:19,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:56:19,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:56:18" (1/3) ... [2024-11-12 16:56:19,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489619eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:19, skipping insertion in model container [2024-11-12 16:56:19,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:19" (2/3) ... [2024-11-12 16:56:19,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489619eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:19, skipping insertion in model container [2024-11-12 16:56:19,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:19" (3/3) ... [2024-11-12 16:56:19,665 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2024-11-12 16:56:19,680 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:56:19,680 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 16:56:19,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:56:19,734 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;@298ac6f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:56:19,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 16:56:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 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-12 16:56:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 16:56:19,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:19,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 16:56:19,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:19,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2024-11-12 16:56:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:19,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259124374] [2024-11-12 16:56:19,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:19,999 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-12 16:56:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259124374] [2024-11-12 16:56:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259124374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:56:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444783484] [2024-11-12 16:56:20,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:20,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:20,031 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 16:56:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:20,086 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-12 16:56:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 16:56:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:20,097 INFO L225 Difference]: With dead ends: 48 [2024-11-12 16:56:20,098 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 16:56:20,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:20,106 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:20,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 16:56:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-12 16:56:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.55) internal successors, (31), 26 states have internal predecessors, (31), 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-12 16:56:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-12 16:56:20,140 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 4 [2024-11-12 16:56:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:20,140 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-12 16:56:20,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12 16:56:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-12 16:56:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 16:56:20,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:20,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 16:56:20,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:56:20,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2024-11-12 16:56:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993060656] [2024-11-12 16:56:20,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:20,239 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-12 16:56:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993060656] [2024-11-12 16:56:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993060656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:56:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344346786] [2024-11-12 16:56:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:20,246 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:20,279 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-12 16:56:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 16:56:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:20,281 INFO L225 Difference]: With dead ends: 31 [2024-11-12 16:56:20,281 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 16:56:20,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:20,283 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:20,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 16:56:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 16:56:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 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-12 16:56:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-12 16:56:20,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 5 [2024-11-12 16:56:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-12 16:56:20,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-12 16:56:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:56:20,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:20,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:56:20,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 262867306, now seen corresponding path program 1 times [2024-11-12 16:56:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888798310] [2024-11-12 16:56:20,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:20,658 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-12 16:56:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888798310] [2024-11-12 16:56:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888798310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:56:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121721297] [2024-11-12 16:56:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:20,662 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:20,741 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-12 16:56:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:56:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:20,743 INFO L225 Difference]: With dead ends: 57 [2024-11-12 16:56:20,743 INFO L226 Difference]: Without dead ends: 32 [2024-11-12 16:56:20,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:56:20,744 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:20,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-12 16:56:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-12 16:56:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 30 states have internal predecessors, (35), 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-12 16:56:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-12 16:56:20,752 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2024-11-12 16:56:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-12 16:56:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-12 16:56:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:56:20,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:20,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:56:20,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:20,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash 262926888, now seen corresponding path program 1 times [2024-11-12 16:56:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192908879] [2024-11-12 16:56:20,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:20,835 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-12 16:56:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192908879] [2024-11-12 16:56:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192908879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:20,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:56:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228611040] [2024-11-12 16:56:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:20,838 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:20,875 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-12 16:56:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:56:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:20,876 INFO L225 Difference]: With dead ends: 37 [2024-11-12 16:56:20,876 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 16:56:20,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:20,879 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 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-12 16:56:20,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 16:56:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 16:56:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 34 states have internal predecessors, (39), 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-12 16:56:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-12 16:56:20,885 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 9 [2024-11-12 16:56:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-12 16:56:20,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-12 16:56:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:56:20,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:20,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:20,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:56:20,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1459934495, now seen corresponding path program 1 times [2024-11-12 16:56:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831198352] [2024-11-12 16:56:20,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:20,972 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-12 16:56:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831198352] [2024-11-12 16:56:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831198352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:56:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777522039] [2024-11-12 16:56:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:20,975 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-12 16:56:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,023 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-12 16:56:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:56:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,026 INFO L225 Difference]: With dead ends: 55 [2024-11-12 16:56:21,026 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 16:56:21,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 16:56:21,027 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 16:56:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-12 16:56:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-12 16:56:21,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2024-11-12 16:56:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-12 16:56:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-12 16:56:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-12 16:56:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:56:21,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:56:21,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1459917836, now seen corresponding path program 1 times [2024-11-12 16:56:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802156001] [2024-11-12 16:56:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802156001] [2024-11-12 16:56:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802156001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:56:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105591610] [2024-11-12 16:56:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:21,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:21,150 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-12 16:56:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,201 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-12 16:56:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:21,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:56:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,203 INFO L225 Difference]: With dead ends: 38 [2024-11-12 16:56:21,203 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 16:56:21,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:21,204 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 16:56:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 16:56:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 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-12 16:56:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-12 16:56:21,209 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 15 [2024-11-12 16:56:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,209 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-12 16:56:21,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-12 16:56:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-12 16:56:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:56:21,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:56:21,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1986266839, now seen corresponding path program 1 times [2024-11-12 16:56:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887862470] [2024-11-12 16:56:21,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,260 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-12 16:56:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887862470] [2024-11-12 16:56:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887862470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:56:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959018130] [2024-11-12 16:56:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:21,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:21,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:21,263 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-12 16:56:21,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,287 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-12 16:56:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 16:56:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,289 INFO L225 Difference]: With dead ends: 37 [2024-11-12 16:56:21,289 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 16:56:21,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:21,292 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 16:56:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 16:56:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 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-12 16:56:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-12 16:56:21,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2024-11-12 16:56:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,299 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-12 16:56:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-12 16:56:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-12 16:56:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:56:21,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:56:21,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1444729942, now seen corresponding path program 1 times [2024-11-12 16:56:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32509193] [2024-11-12 16:56:21,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,391 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-12 16:56:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32509193] [2024-11-12 16:56:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32509193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:56:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45677236] [2024-11-12 16:56:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:21,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:56:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:56:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:56:21,393 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 16:56:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,451 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-12 16:56:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:56:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 16:56:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,452 INFO L225 Difference]: With dead ends: 48 [2024-11-12 16:56:21,454 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 16:56:21,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:56:21,455 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 16:56:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-11-12 16:56:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 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-12 16:56:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-12 16:56:21,464 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2024-11-12 16:56:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-12 16:56:21,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 16:56:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-12 16:56:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 16:56:21,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:56:21,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1111040472, now seen corresponding path program 1 times [2024-11-12 16:56:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635005771] [2024-11-12 16:56:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,529 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-12 16:56:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635005771] [2024-11-12 16:56:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635005771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:21,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:56:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799412274] [2024-11-12 16:56:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:56:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:56:21,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:56:21,533 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 16:56:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,548 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-12 16:56:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:56:21,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 16:56:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,550 INFO L225 Difference]: With dead ends: 40 [2024-11-12 16:56:21,554 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 16:56:21,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 16:56:21,555 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 16:56:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-12 16:56:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 38 states have internal predecessors, (43), 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-12 16:56:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-12 16:56:21,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2024-11-12 16:56:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,562 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-12 16:56:21,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-12 16:56:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-12 16:56:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 16:56:21,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:56:21,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1529834374, now seen corresponding path program 1 times [2024-11-12 16:56:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20788904] [2024-11-12 16:56:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20788904] [2024-11-12 16:56:21,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20788904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:21,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76765998] [2024-11-12 16:56:21,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:21,670 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-12 16:56:21,672 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-12 16:56:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:21,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:56:21,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:21,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:56:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76765998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:56:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 16:56:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805221140] [2024-11-12 16:56:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:56:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:56:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:56:21,877 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 16:56:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:21,911 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-12 16:56:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:56:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 16:56:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:21,913 INFO L225 Difference]: With dead ends: 43 [2024-11-12 16:56:21,913 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 16:56:21,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:56:21,914 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:21,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 16:56:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 16:56:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 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-12 16:56:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-12 16:56:21,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2024-11-12 16:56:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:21,919 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-12 16:56:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 16:56:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-12 16:56:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 16:56:21,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:21,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:21,941 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-12 16:56:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 16:56:22,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:22,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 82516356, now seen corresponding path program 1 times [2024-11-12 16:56:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:22,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891624263] [2024-11-12 16:56:22,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:22,250 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-12 16:56:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891624263] [2024-11-12 16:56:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891624263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:56:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876002981] [2024-11-12 16:56:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:56:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:56:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:56:22,253 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-12 16:56:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:22,298 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-11-12 16:56:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:56:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-12 16:56:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:22,299 INFO L225 Difference]: With dead ends: 49 [2024-11-12 16:56:22,299 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 16:56:22,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:56:22,300 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:22,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 16:56:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-11-12 16:56:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 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-12 16:56:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-12 16:56:22,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2024-11-12 16:56:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-12 16:56:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-12 16:56:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-12 16:56:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 16:56:22,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:22,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:56:22,309 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash -180225285, now seen corresponding path program 1 times [2024-11-12 16:56:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799874942] [2024-11-12 16:56:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799874942] [2024-11-12 16:56:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799874942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114108000] [2024-11-12 16:56:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:22,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:22,417 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-12 16:56:22,418 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-12 16:56:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:22,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:56:22,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:22,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114108000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:22,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-12 16:56:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267301705] [2024-11-12 16:56:22,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:56:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:56:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:56:22,717 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 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-12 16:56:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:22,781 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-11-12 16:56:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:56:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-12 16:56:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:22,783 INFO L225 Difference]: With dead ends: 68 [2024-11-12 16:56:22,783 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 16:56:22,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:56:22,783 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:22,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 16:56:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-12 16:56:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 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-12 16:56:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-12 16:56:22,789 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 20 [2024-11-12 16:56:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:22,789 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-12 16:56:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 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-12 16:56:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-12 16:56:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 16:56:22,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:22,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:22,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:56:22,990 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,SelfDestructingSolverStorable11 [2024-11-12 16:56:22,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1399522472, now seen corresponding path program 1 times [2024-11-12 16:56:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322398609] [2024-11-12 16:56:22,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322398609] [2024-11-12 16:56:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322398609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451332482] [2024-11-12 16:56:23,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:23,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:23,168 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-12 16:56:23,170 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-12 16:56:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:23,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:56:23,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:23,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451332482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:23,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-12 16:56:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213519264] [2024-11-12 16:56:23,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 16:56:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:23,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 16:56:23,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-12 16:56:23,440 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 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-12 16:56:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:23,511 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-12 16:56:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:56:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 16:56:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:23,513 INFO L225 Difference]: With dead ends: 67 [2024-11-12 16:56:23,513 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 16:56:23,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-12 16:56:23,514 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:23,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 98 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 16:56:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2024-11-12 16:56:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 59 states have internal predecessors, (67), 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-12 16:56:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-12 16:56:23,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 27 [2024-11-12 16:56:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:23,521 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-12 16:56:23,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 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-12 16:56:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-12 16:56:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 16:56:23,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:23,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:23,542 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-12 16:56:23,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:23,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1926508530, now seen corresponding path program 1 times [2024-11-12 16:56:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877686660] [2024-11-12 16:56:23,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877686660] [2024-11-12 16:56:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877686660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147936949] [2024-11-12 16:56:23,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:23,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:23,926 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-12 16:56:23,928 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-12 16:56:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:24,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:56:24,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:24,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147936949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:24,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-12 16:56:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150861641] [2024-11-12 16:56:24,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 16:56:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 16:56:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:56:24,254 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 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-12 16:56:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:24,328 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-12 16:56:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 16:56:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-12 16:56:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:24,329 INFO L225 Difference]: With dead ends: 72 [2024-11-12 16:56:24,329 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 16:56:24,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-12 16:56:24,330 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:24,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 97 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 16:56:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-12 16:56:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 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-12 16:56:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-12 16:56:24,334 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 30 [2024-11-12 16:56:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:24,334 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-12 16:56:24,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 18 states have internal predecessors, (68), 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-12 16:56:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-12 16:56:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 16:56:24,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:24,335 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2024-11-12 16:56:24,353 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-12 16:56:24,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:24,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -776926779, now seen corresponding path program 2 times [2024-11-12 16:56:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041432517] [2024-11-12 16:56:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041432517] [2024-11-12 16:56:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041432517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517956795] [2024-11-12 16:56:24,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:56:24,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:24,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:24,799 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-12 16:56:24,800 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-12 16:56:25,002 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:56:25,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:56:25,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 16:56:25,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:25,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517956795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:25,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-12 16:56:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485652063] [2024-11-12 16:56:25,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 16:56:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 16:56:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-12 16:56:25,252 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 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-12 16:56:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:25,302 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2024-11-12 16:56:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:56:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-12 16:56:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:25,303 INFO L225 Difference]: With dead ends: 112 [2024-11-12 16:56:25,303 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 16:56:25,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-12 16:56:25,304 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:25,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 16:56:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-12 16:56:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1) internal successors, (121), 110 states have internal predecessors, (121), 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-12 16:56:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-12 16:56:25,310 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2024-11-12 16:56:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:25,310 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-12 16:56:25,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.695652173913044) internal successors, (108), 24 states have internal predecessors, (108), 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-12 16:56:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-11-12 16:56:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 16:56:25,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:25,311 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2024-11-12 16:56:25,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 16:56:25,511 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,SelfDestructingSolverStorable14 [2024-11-12 16:56:25,512 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1073197351, now seen corresponding path program 3 times [2024-11-12 16:56:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:25,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973436125] [2024-11-12 16:56:25,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973436125] [2024-11-12 16:56:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973436125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82138155] [2024-11-12 16:56:26,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:56:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:26,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:26,453 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-12 16:56:26,455 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-12 16:56:43,073 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 16:56:43,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:56:43,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 16:56:43,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:43,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82138155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:43,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2024-11-12 16:56:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598132550] [2024-11-12 16:56:43,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 16:56:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 16:56:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 16:56:43,896 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 48 states, 47 states have (on average 4.851063829787234) internal successors, (228), 48 states have internal predecessors, (228), 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-12 16:56:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:44,031 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2024-11-12 16:56:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 16:56:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.851063829787234) internal successors, (228), 48 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-12 16:56:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:44,032 INFO L225 Difference]: With dead ends: 232 [2024-11-12 16:56:44,033 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 16:56:44,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 16:56:44,035 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:44,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 236 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 16:56:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-11-12 16:56:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.1) internal successors, (253), 230 states have internal predecessors, (253), 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-12 16:56:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 253 transitions. [2024-11-12 16:56:44,048 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 253 transitions. Word has length 110 [2024-11-12 16:56:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 253 transitions. [2024-11-12 16:56:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.851063829787234) internal successors, (228), 48 states have internal predecessors, (228), 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-12 16:56:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 253 transitions. [2024-11-12 16:56:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-12 16:56:44,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:44,052 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1] [2024-11-12 16:56:44,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 16:56:44,255 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-12 16:56:44,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 16:56:44,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash 22345473, now seen corresponding path program 4 times [2024-11-12 16:56:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798895518] [2024-11-12 16:56:44,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2486 backedges. 0 proven. 2486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798895518] [2024-11-12 16:56:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798895518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451318666] [2024-11-12 16:56:46,883 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:56:46,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:46,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:46,885 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-12 16:56:46,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process