./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/nla-digbench-scaling/fermat1-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:09:59,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:09:59,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:09:59,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:09:59,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:09:59,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:09:59,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:09:59,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:09:59,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:09:59,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:09:59,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:09:59,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:09:59,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:09:59,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:09:59,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:09:59,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:09:59,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:09:59,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:09:59,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:09:59,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:09:59,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:09:59,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:09:59,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:09:59,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:09:59,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:09:59,306 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:09:59,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:09:59,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:09:59,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:09:59,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:09:59,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:09:59,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:09:59,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:09:59,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:09:59,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:09:59,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:09:59,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:09:59,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:09:59,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:09:59,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:09:59,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:09:59,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:09:59,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:09:59,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:09:59,312 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 -> 7f97a505fe6488215cf15708661c3a7c87a5132fbff317a4b6f7f9cc44d66008 [2024-11-10 19:09:59,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:09:59,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:09:59,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:09:59,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:09:59,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:09:59,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-10 19:10:01,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:10:01,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:10:01,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2024-11-10 19:10:01,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c63ea13c/068101f346c14ad7a45f5a12c0e12a85/FLAGe0d322559 [2024-11-10 19:10:01,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c63ea13c/068101f346c14ad7a45f5a12c0e12a85 [2024-11-10 19:10:01,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:10:01,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:10:01,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:10:01,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:10:01,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:10:01,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340e4128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01, skipping insertion in model container [2024-11-10 19:10:01,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:10:01,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:10:01,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:10:01,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:10:01,564 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:10:01,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01 WrapperNode [2024-11-10 19:10:01,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:10:01,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:10:01,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:10:01,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:10:01,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,602 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2024-11-10 19:10:01,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:10:01,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:10:01,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:10:01,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:10:01,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,637 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:10:01,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:10:01,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:10:01,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:10:01,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:10:01,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (1/1) ... [2024-11-10 19:10:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:10:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:01,699 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-10 19:10:01,706 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-10 19:10:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:10:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:10:01,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:10:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:10:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:10:01,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:10:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:10:01,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:10:01,864 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:10:01,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:10:02,509 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-10 19:10:02,510 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:10:02,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:10:02,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:10:02,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:02 BoogieIcfgContainer [2024-11-10 19:10:02,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:10:02,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:10:02,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:10:02,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:10:02,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:10:01" (1/3) ... [2024-11-10 19:10:02,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cf9b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:02, skipping insertion in model container [2024-11-10 19:10:02,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:10:01" (2/3) ... [2024-11-10 19:10:02,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cf9b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:02, skipping insertion in model container [2024-11-10 19:10:02,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:02" (3/3) ... [2024-11-10 19:10:02,543 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2024-11-10 19:10:02,558 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:10:02,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-11-10 19:10:02,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:10:02,638 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;@2fe7f4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:10:02,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-11-10 19:10:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 19:10:02,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:02,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 19:10:02,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:02,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 261127, now seen corresponding path program 1 times [2024-11-10 19:10:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374882048] [2024-11-10 19:10:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,800 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-10 19:10:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374882048] [2024-11-10 19:10:02,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374882048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:02,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:02,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:02,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895304885] [2024-11-10 19:10:02,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:02,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:02,833 INFO L87 Difference]: Start difference. First operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 19:10:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:02,916 INFO L93 Difference]: Finished difference Result 445 states and 489 transitions. [2024-11-10 19:10:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 19:10:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:02,925 INFO L225 Difference]: With dead ends: 445 [2024-11-10 19:10:02,925 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 19:10:02,928 INFO L431 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-10 19:10:02,931 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:02,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 19:10:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-10 19:10:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 124 states have (on average 1.717741935483871) internal successors, (213), 207 states have internal predecessors, (213), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:10:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-11-10 19:10:02,979 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 3 [2024-11-10 19:10:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-11-10 19:10:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 19:10:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-11-10 19:10:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 19:10:02,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:02,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 19:10:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:10:02,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 8095135, now seen corresponding path program 1 times [2024-11-10 19:10:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738309220] [2024-11-10 19:10:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,019 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-10 19:10:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738309220] [2024-11-10 19:10:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738309220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93998202] [2024-11-10 19:10:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,026 INFO L87 Difference]: Start difference. First operand 215 states and 223 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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-10 19:10:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,081 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-11-10 19:10:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) 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-10 19:10:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,083 INFO L225 Difference]: With dead ends: 215 [2024-11-10 19:10:03,083 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 19:10:03,084 INFO L431 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-10 19:10:03,085 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 14 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 19:10:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-10 19:10:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 124 states have (on average 1.685483870967742) internal successors, (209), 203 states have internal predecessors, (209), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:10:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2024-11-10 19:10:03,102 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 219 transitions. Word has length 4 [2024-11-10 19:10:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 219 transitions. [2024-11-10 19:10:03,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) 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-10 19:10:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 219 transitions. [2024-11-10 19:10:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:10:03,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:03,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:10:03,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1504860389, now seen corresponding path program 1 times [2024-11-10 19:10:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283641760] [2024-11-10 19:10:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265098940] [2024-11-10 19:10:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:03,132 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-10 19:10:03,134 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-10 19:10:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:03,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:03,259 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-10 19:10:03,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283641760] [2024-11-10 19:10:03,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:03,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265098940] [2024-11-10 19:10:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265098940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473618219] [2024-11-10 19:10:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,265 INFO L87 Difference]: Start difference. First operand 211 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10 19:10:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,314 INFO L93 Difference]: Finished difference Result 211 states and 219 transitions. [2024-11-10 19:10:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:03,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-10 19:10:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,317 INFO L225 Difference]: With dead ends: 211 [2024-11-10 19:10:03,320 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 19:10:03,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10 19:10:03,321 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 395 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 19:10:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 19:10:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.6693548387096775) internal successors, (207), 201 states have internal predecessors, (207), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:10:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 217 transitions. [2024-11-10 19:10:03,342 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 217 transitions. Word has length 8 [2024-11-10 19:10:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 217 transitions. [2024-11-10 19:10:03,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10 19:10:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 217 transitions. [2024-11-10 19:10:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 19:10:03,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:03,360 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-10 19:10:03,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 286219215, now seen corresponding path program 1 times [2024-11-10 19:10:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381312582] [2024-11-10 19:10:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071544778] [2024-11-10 19:10:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:03,593 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-10 19:10:03,594 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-10 19:10:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:10:03,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:03,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381312582] [2024-11-10 19:10:03,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071544778] [2024-11-10 19:10:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071544778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443459950] [2024-11-10 19:10:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,698 INFO L87 Difference]: Start difference. First operand 209 states and 217 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,750 INFO L93 Difference]: Finished difference Result 209 states and 217 transitions. [2024-11-10 19:10:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:03,751 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-10 19:10:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,754 INFO L225 Difference]: With dead ends: 209 [2024-11-10 19:10:03,754 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 19:10:03,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-10 19:10:03,757 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 170 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 196 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 19:10:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-10 19:10:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.653225806451613) internal successors, (205), 199 states have internal predecessors, (205), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:10:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 215 transitions. [2024-11-10 19:10:03,806 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 215 transitions. Word has length 26 [2024-11-10 19:10:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,810 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 215 transitions. [2024-11-10 19:10:03,810 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 215 transitions. [2024-11-10 19:10:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 19:10:03,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:03,841 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-10 19:10:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 19:10:04,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 282861244, now seen corresponding path program 1 times [2024-11-10 19:10:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535692970] [2024-11-10 19:10:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535692970] [2024-11-10 19:10:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535692970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720804775] [2024-11-10 19:10:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:04,333 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-10 19:10:04,334 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-10 19:10:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:04,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:04,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720804775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 19:10:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878110159] [2024-11-10 19:10:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:04,927 INFO L87 Difference]: Start difference. First operand 207 states and 215 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,082 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2024-11-10 19:10:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:10:05,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-10 19:10:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,084 INFO L225 Difference]: With dead ends: 207 [2024-11-10 19:10:05,085 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 19:10:05,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:05,086 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 170 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 706 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 19:10:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-10 19:10:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 197 states have internal predecessors, (203), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:10:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2024-11-10 19:10:05,095 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 27 [2024-11-10 19:10:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,095 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2024-11-10 19:10:05,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2024-11-10 19:10:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 19:10:05,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,113 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-10 19:10:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:05,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -6346004, now seen corresponding path program 1 times [2024-11-10 19:10:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647939692] [2024-11-10 19:10:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647939692] [2024-11-10 19:10:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647939692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:05,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531984276] [2024-11-10 19:10:05,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:05,395 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,434 INFO L93 Difference]: Finished difference Result 286 states and 295 transitions. [2024-11-10 19:10:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-10 19:10:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,436 INFO L225 Difference]: With dead ends: 286 [2024-11-10 19:10:05,436 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:10:05,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10 19:10:05,437 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 87 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:10:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 233. [2024-11-10 19:10:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 224 states have internal predecessors, (247), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2024-11-10 19:10:05,448 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 30 [2024-11-10 19:10:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,451 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2024-11-10 19:10:05,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2024-11-10 19:10:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 19:10:05,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:10:05,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -196725960, now seen corresponding path program 1 times [2024-11-10 19:10:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869995965] [2024-11-10 19:10:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869995965] [2024-11-10 19:10:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869995965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402925389] [2024-11-10 19:10:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:05,535 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,574 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2024-11-10 19:10:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-10 19:10:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,577 INFO L225 Difference]: With dead ends: 262 [2024-11-10 19:10:05,577 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 19:10:05,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10 19:10:05,580 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 10 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 593 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 19:10:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-10 19:10:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6333333333333333) internal successors, (245), 224 states have internal predecessors, (245), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 257 transitions. [2024-11-10 19:10:05,589 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 257 transitions. Word has length 31 [2024-11-10 19:10:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,591 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 257 transitions. [2024-11-10 19:10:05,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 257 transitions. [2024-11-10 19:10:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:10:05,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:10:05,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1967446504, now seen corresponding path program 1 times [2024-11-10 19:10:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731300398] [2024-11-10 19:10:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:05,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731300398] [2024-11-10 19:10:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731300398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891276144] [2024-11-10 19:10:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:05,682 INFO L87 Difference]: Start difference. First operand 233 states and 257 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,777 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2024-11-10 19:10:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-10 19:10:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,779 INFO L225 Difference]: With dead ends: 288 [2024-11-10 19:10:05,779 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:10:05,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10 19:10:05,780 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 145 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 287 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:10:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 251. [2024-11-10 19:10:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2024-11-10 19:10:05,795 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 34 [2024-11-10 19:10:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,796 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2024-11-10 19:10:05,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2024-11-10 19:10:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:10:05,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:10:05,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash 861299637, now seen corresponding path program 1 times [2024-11-10 19:10:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005513240] [2024-11-10 19:10:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005513240] [2024-11-10 19:10:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005513240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:05,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221293399] [2024-11-10 19:10:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:05,879 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:06,031 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2024-11-10 19:10:06,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:06,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-10 19:10:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:06,034 INFO L225 Difference]: With dead ends: 291 [2024-11-10 19:10:06,034 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 19:10:06,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:06,036 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:06,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 446 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 19:10:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 254. [2024-11-10 19:10:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 245 states have internal predecessors, (273), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-10 19:10:06,055 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 35 [2024-11-10 19:10:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:06,056 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-10 19:10:06,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-10 19:10:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:10:06,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:06,057 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:10:06,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 930485126, now seen corresponding path program 1 times [2024-11-10 19:10:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187535134] [2024-11-10 19:10:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526732280] [2024-11-10 19:10:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:06,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:06,082 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-10 19:10:06,084 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-10 19:10:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:10:06,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:06,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187535134] [2024-11-10 19:10:06,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526732280] [2024-11-10 19:10:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526732280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216799328] [2024-11-10 19:10:06,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:06,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:06,198 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:06,328 INFO L93 Difference]: Finished difference Result 408 states and 454 transitions. [2024-11-10 19:10:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-10 19:10:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:06,333 INFO L225 Difference]: With dead ends: 408 [2024-11-10 19:10:06,333 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 19:10:06,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10 19:10:06,334 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:06,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 374 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 19:10:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 329. [2024-11-10 19:10:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 243 states have (on average 1.625514403292181) internal successors, (395), 317 states have internal predecessors, (395), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:10:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 413 transitions. [2024-11-10 19:10:06,360 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 413 transitions. Word has length 36 [2024-11-10 19:10:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 413 transitions. [2024-11-10 19:10:06,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 413 transitions. [2024-11-10 19:10:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:10:06,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:06,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:06,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:06,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:06,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1219732013, now seen corresponding path program 1 times [2024-11-10 19:10:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278441183] [2024-11-10 19:10:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:06,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:06,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278441183] [2024-11-10 19:10:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278441183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484076339] [2024-11-10 19:10:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:06,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:06,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:06,731 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-10 19:10:06,732 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-10 19:10:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:06,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:06,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:07,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484076339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:07,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 19:10:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536915881] [2024-11-10 19:10:07,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:07,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:07,216 INFO L87 Difference]: Start difference. First operand 329 states and 413 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:07,617 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2024-11-10 19:10:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:10:07,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-10 19:10:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:07,620 INFO L225 Difference]: With dead ends: 448 [2024-11-10 19:10:07,620 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 19:10:07,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:10:07,621 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 886 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:07,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1302 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:10:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 19:10:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 335. [2024-11-10 19:10:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 249 states have (on average 1.606425702811245) internal successors, (400), 323 states have internal predecessors, (400), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:10:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 418 transitions. [2024-11-10 19:10:07,637 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 418 transitions. Word has length 37 [2024-11-10 19:10:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:07,637 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 418 transitions. [2024-11-10 19:10:07,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 418 transitions. [2024-11-10 19:10:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 19:10:07,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:07,638 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:07,654 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-10 19:10:07,842 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,SelfDestructingSolverStorable10 [2024-11-10 19:10:07,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:07,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:07,843 INFO L85 PathProgramCache]: Analyzing trace with hash 363612145, now seen corresponding path program 1 times [2024-11-10 19:10:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:07,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837781904] [2024-11-10 19:10:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570657837] [2024-11-10 19:10:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:07,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:07,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:07,856 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-10 19:10:07,857 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-10 19:10:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:07,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:07,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:08,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837781904] [2024-11-10 19:10:08,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570657837] [2024-11-10 19:10:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570657837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:08,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-10 19:10:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867698923] [2024-11-10 19:10:08,239 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:08,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:10:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:10:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:10:08,241 INFO L87 Difference]: Start difference. First operand 335 states and 418 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:10,631 INFO L93 Difference]: Finished difference Result 525 states and 642 transitions. [2024-11-10 19:10:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:10:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-10 19:10:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:10,648 INFO L225 Difference]: With dead ends: 525 [2024-11-10 19:10:10,648 INFO L226 Difference]: Without dead ends: 498 [2024-11-10 19:10:10,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:10,649 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 451 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:10,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 545 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 19:10:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-10 19:10:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 463. [2024-11-10 19:10:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 374 states have (on average 1.5133689839572193) internal successors, (566), 448 states have internal predecessors, (566), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:10:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 590 transitions. [2024-11-10 19:10:10,677 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 590 transitions. Word has length 39 [2024-11-10 19:10:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 590 transitions. [2024-11-10 19:10:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 590 transitions. [2024-11-10 19:10:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:10:10,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:10,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:10,695 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-10 19:10:10,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:10,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1538925071, now seen corresponding path program 1 times [2024-11-10 19:10:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:10,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707772275] [2024-11-10 19:10:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423909273] [2024-11-10 19:10:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:10,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:10,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:10,900 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-10 19:10:10,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:10:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:10,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:10,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707772275] [2024-11-10 19:10:10,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423909273] [2024-11-10 19:10:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423909273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:10,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031962496] [2024-11-10 19:10:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:10,976 INFO L87 Difference]: Start difference. First operand 463 states and 590 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:11,212 INFO L93 Difference]: Finished difference Result 667 states and 835 transitions. [2024-11-10 19:10:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-10 19:10:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:11,215 INFO L225 Difference]: With dead ends: 667 [2024-11-10 19:10:11,215 INFO L226 Difference]: Without dead ends: 626 [2024-11-10 19:10:11,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-10 19:10:11,218 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:11,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 320 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-10 19:10:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 592. [2024-11-10 19:10:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 500 states have (on average 1.456) internal successors, (728), 574 states have internal predecessors, (728), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 19:10:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 758 transitions. [2024-11-10 19:10:11,251 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 758 transitions. Word has length 41 [2024-11-10 19:10:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:11,251 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 758 transitions. [2024-11-10 19:10:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 758 transitions. [2024-11-10 19:10:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 19:10:11,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:11,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:11,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:10:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:11,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -725034534, now seen corresponding path program 1 times [2024-11-10 19:10:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203670535] [2024-11-10 19:10:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203670535] [2024-11-10 19:10:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203670535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:11,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029297642] [2024-11-10 19:10:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:11,554 INFO L87 Difference]: Start difference. First operand 592 states and 758 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:11,649 INFO L93 Difference]: Finished difference Result 688 states and 867 transitions. [2024-11-10 19:10:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:10:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-10 19:10:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:11,652 INFO L225 Difference]: With dead ends: 688 [2024-11-10 19:10:11,652 INFO L226 Difference]: Without dead ends: 687 [2024-11-10 19:10:11,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:11,653 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:11,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 796 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-10 19:10:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 658. [2024-11-10 19:10:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4440497335701599) internal successors, (813), 636 states have internal predecessors, (813), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 847 transitions. [2024-11-10 19:10:11,689 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 847 transitions. Word has length 59 [2024-11-10 19:10:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 847 transitions. [2024-11-10 19:10:11,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 847 transitions. [2024-11-10 19:10:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 19:10:11,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:11,690 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:10:11,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1001233958, now seen corresponding path program 1 times [2024-11-10 19:10:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688515135] [2024-11-10 19:10:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688515135] [2024-11-10 19:10:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688515135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654970946] [2024-11-10 19:10:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:11,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:11,788 INFO L87 Difference]: Start difference. First operand 658 states and 847 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:11,891 INFO L93 Difference]: Finished difference Result 1198 states and 1552 transitions. [2024-11-10 19:10:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:10:11,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-11-10 19:10:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:11,895 INFO L225 Difference]: With dead ends: 1198 [2024-11-10 19:10:11,895 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 19:10:11,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:11,896 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 18 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:11,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 958 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 19:10:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-10 19:10:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4404973357015987) internal successors, (811), 636 states have internal predecessors, (811), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 845 transitions. [2024-11-10 19:10:11,928 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 845 transitions. Word has length 60 [2024-11-10 19:10:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 845 transitions. [2024-11-10 19:10:11,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 19:10:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 845 transitions. [2024-11-10 19:10:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 19:10:11,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:11,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:11,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 19:10:11,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:11,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1954930230, now seen corresponding path program 1 times [2024-11-10 19:10:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153741310] [2024-11-10 19:10:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:11,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153741310] [2024-11-10 19:10:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153741310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040504910] [2024-11-10 19:10:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:12,029 INFO L87 Difference]: Start difference. First operand 658 states and 845 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:12,273 INFO L93 Difference]: Finished difference Result 694 states and 849 transitions. [2024-11-10 19:10:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:12,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-10 19:10:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:12,276 INFO L225 Difference]: With dead ends: 694 [2024-11-10 19:10:12,276 INFO L226 Difference]: Without dead ends: 693 [2024-11-10 19:10:12,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:12,279 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:12,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-10 19:10:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 658. [2024-11-10 19:10:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4351687388987566) internal successors, (808), 636 states have internal predecessors, (808), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 842 transitions. [2024-11-10 19:10:12,313 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 842 transitions. Word has length 87 [2024-11-10 19:10:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:12,314 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 842 transitions. [2024-11-10 19:10:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 842 transitions. [2024-11-10 19:10:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:12,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:12,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 19:10:12,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 473293775, now seen corresponding path program 1 times [2024-11-10 19:10:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:12,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989708615] [2024-11-10 19:10:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:12,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:12,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989708615] [2024-11-10 19:10:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989708615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470715210] [2024-11-10 19:10:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:12,458 INFO L87 Difference]: Start difference. First operand 658 states and 842 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:12,608 INFO L93 Difference]: Finished difference Result 663 states and 845 transitions. [2024-11-10 19:10:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-10 19:10:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:12,611 INFO L225 Difference]: With dead ends: 663 [2024-11-10 19:10:12,611 INFO L226 Difference]: Without dead ends: 660 [2024-11-10 19:10:12,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:12,612 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 294 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:12,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 871 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-10 19:10:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2024-11-10 19:10:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 566 states have (on average 1.3975265017667844) internal successors, (791), 636 states have internal predecessors, (791), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 825 transitions. [2024-11-10 19:10:12,655 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 825 transitions. Word has length 88 [2024-11-10 19:10:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:12,656 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 825 transitions. [2024-11-10 19:10:12,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 825 transitions. [2024-11-10 19:10:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:12,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:12,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:12,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 19:10:12,657 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:12,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 473295056, now seen corresponding path program 1 times [2024-11-10 19:10:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595931933] [2024-11-10 19:10:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595931933] [2024-11-10 19:10:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595931933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:10:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993496467] [2024-11-10 19:10:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:12,764 INFO L87 Difference]: Start difference. First operand 659 states and 825 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:13,207 INFO L93 Difference]: Finished difference Result 704 states and 850 transitions. [2024-11-10 19:10:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-10 19:10:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:13,211 INFO L225 Difference]: With dead ends: 704 [2024-11-10 19:10:13,211 INFO L226 Difference]: Without dead ends: 703 [2024-11-10 19:10:13,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:13,212 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 376 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:13,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 337 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:10:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-10 19:10:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2024-11-10 19:10:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 566 states have (on average 1.392226148409894) internal successors, (788), 636 states have internal predecessors, (788), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 822 transitions. [2024-11-10 19:10:13,243 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 822 transitions. Word has length 88 [2024-11-10 19:10:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:13,243 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 822 transitions. [2024-11-10 19:10:13,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 822 transitions. [2024-11-10 19:10:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 19:10:13,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:13,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:13,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 19:10:13,245 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1787205195, now seen corresponding path program 1 times [2024-11-10 19:10:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:13,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046670352] [2024-11-10 19:10:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046670352] [2024-11-10 19:10:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046670352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:13,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572723293] [2024-11-10 19:10:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:13,358 INFO L87 Difference]: Start difference. First operand 659 states and 822 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:13,498 INFO L93 Difference]: Finished difference Result 1215 states and 1522 transitions. [2024-11-10 19:10:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 89 [2024-11-10 19:10:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:13,501 INFO L225 Difference]: With dead ends: 1215 [2024-11-10 19:10:13,501 INFO L226 Difference]: Without dead ends: 674 [2024-11-10 19:10:13,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:13,503 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 37 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:13,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1290 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-10 19:10:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 668. [2024-11-10 19:10:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 574 states have (on average 1.386759581881533) internal successors, (796), 644 states have internal predecessors, (796), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 830 transitions. [2024-11-10 19:10:13,533 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 830 transitions. Word has length 89 [2024-11-10 19:10:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 830 transitions. [2024-11-10 19:10:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:10:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 830 transitions. [2024-11-10 19:10:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 19:10:13,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:13,535 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:13,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 19:10:13,535 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:13,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash -572581879, now seen corresponding path program 1 times [2024-11-10 19:10:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149612344] [2024-11-10 19:10:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:13,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149612344] [2024-11-10 19:10:13,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149612344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668858458] [2024-11-10 19:10:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:13,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:13,641 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:13,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:10:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:13,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:13,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668858458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:13,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:13,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2024-11-10 19:10:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100796464] [2024-11-10 19:10:13,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:13,976 INFO L87 Difference]: Start difference. First operand 668 states and 830 transitions. Second operand has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:14,195 INFO L93 Difference]: Finished difference Result 1122 states and 1369 transitions. [2024-11-10 19:10:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 19:10:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 95 [2024-11-10 19:10:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:14,199 INFO L225 Difference]: With dead ends: 1122 [2024-11-10 19:10:14,199 INFO L226 Difference]: Without dead ends: 785 [2024-11-10 19:10:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-10 19:10:14,202 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 118 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1666 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-10 19:10:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 742. [2024-11-10 19:10:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 644 states have (on average 1.3928571428571428) internal successors, (897), 714 states have internal predecessors, (897), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 19:10:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 935 transitions. [2024-11-10 19:10:14,259 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 935 transitions. Word has length 95 [2024-11-10 19:10:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 935 transitions. [2024-11-10 19:10:14,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 935 transitions. [2024-11-10 19:10:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 19:10:14,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:14,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:14,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 19:10:14,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:14,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:14,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1823456583, now seen corresponding path program 1 times [2024-11-10 19:10:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548804586] [2024-11-10 19:10:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548804586] [2024-11-10 19:10:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548804586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725431716] [2024-11-10 19:10:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:14,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:14,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:10:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:14,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:14,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725431716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:15,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-10 19:10:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268408099] [2024-11-10 19:10:15,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:15,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:15,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:15,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:15,064 INFO L87 Difference]: Start difference. First operand 742 states and 935 transitions. Second operand has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:10:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:16,415 INFO L93 Difference]: Finished difference Result 1958 states and 2424 transitions. [2024-11-10 19:10:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:10:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 98 [2024-11-10 19:10:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:16,421 INFO L225 Difference]: With dead ends: 1958 [2024-11-10 19:10:16,421 INFO L226 Difference]: Without dead ends: 1417 [2024-11-10 19:10:16,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-10 19:10:16,423 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 2132 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:16,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 1022 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 19:10:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-10 19:10:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1079. [2024-11-10 19:10:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 971 states have (on average 1.3861997940267765) internal successors, (1346), 1040 states have internal predecessors, (1346), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 19:10:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1406 transitions. [2024-11-10 19:10:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1406 transitions. Word has length 98 [2024-11-10 19:10:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1406 transitions. [2024-11-10 19:10:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 17.46153846153846) internal successors, (227), 14 states have internal predecessors, (227), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 19:10:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1406 transitions. [2024-11-10 19:10:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 19:10:16,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:16,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:16,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 19:10:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:16,679 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:16,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash 692579334, now seen corresponding path program 1 times [2024-11-10 19:10:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:16,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812471313] [2024-11-10 19:10:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:16,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:16,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812471313] [2024-11-10 19:10:16,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812471313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:16,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467533150] [2024-11-10 19:10:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:16,798 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:16,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 19:10:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:16,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:16,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:35,225 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-11-10 19:10:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 7 not checked. [2024-11-10 19:10:35,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467533150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:35,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:35,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-10 19:10:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739238365] [2024-11-10 19:10:35,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:35,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:35,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:35,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-10 19:10:35,436 INFO L87 Difference]: Start difference. First operand 1079 states and 1406 transitions. Second operand has 14 states, 13 states have (on average 16.846153846153847) internal successors, (219), 14 states have internal predecessors, (219), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 19:10:49,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:54,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:55,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:10:59,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:04,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:05,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:06,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:12,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:13,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:17,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:18,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:19,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:23,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:27,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-10 19:11:31,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]