./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i --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/loop-invgen/id_build.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:52:27,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:52:27,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:52:27,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:52:27,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:52:27,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:52:27,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:52:27,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:52:27,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:52:27,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:52:27,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:52:27,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:52:27,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:52:27,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:52:27,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:52:27,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:52:27,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:52:27,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:52:27,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:52:27,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:52:27,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:52:27,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:52:27,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:52:27,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:52:27,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:52:27,766 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:52:27,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:52:27,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:52:27,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:52:27,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:52:27,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:52:27,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:52:27,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:52:27,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:52:27,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:27,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:52:27,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:52:27,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:52:27,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:52:27,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:52:27,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:52:27,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:52:27,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:52:27,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:52:27,773 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 -> 2c4c8975bee6324b0c0486aa99ba8be369d6762a33e8dd5b012191d5fa43c106 [2024-11-10 18:52:27,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:52:28,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:52:28,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:52:28,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:52:28,022 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:52:28,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/id_build.i [2024-11-10 18:52:29,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:52:29,614 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:52:29,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/id_build.i [2024-11-10 18:52:29,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a599104/ceec221b0fa948fb870ed7461e092a48/FLAG572416a1c [2024-11-10 18:52:29,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a599104/ceec221b0fa948fb870ed7461e092a48 [2024-11-10 18:52:29,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:52:29,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:52:29,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:29,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:52:29,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:52:29,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:29" (1/1) ... [2024-11-10 18:52:29,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8d247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:29, skipping insertion in model container [2024-11-10 18:52:29,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:29" (1/1) ... [2024-11-10 18:52:30,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:52:30,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:30,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:52:30,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:52:30,268 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:52:30,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30 WrapperNode [2024-11-10 18:52:30,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:52:30,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:30,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:52:30,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:52:30,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,301 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2024-11-10 18:52:30,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:52:30,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:52:30,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:52:30,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:52:30,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,329 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 18:52:30,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:52:30,345 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:52:30,345 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:52:30,345 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:52:30,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2024-11-10 18:52:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:52:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:30,379 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 18:52:30,381 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 18:52:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:52:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:52:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:52:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:52:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:52:30,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:52:30,483 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:52:30,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:52:30,652 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-10 18:52:30,653 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:52:30,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:52:30,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:52:30,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:30 BoogieIcfgContainer [2024-11-10 18:52:30,669 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:52:30,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:52:30,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:52:30,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:52:30,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:52:29" (1/3) ... [2024-11-10 18:52:30,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38322d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:30, skipping insertion in model container [2024-11-10 18:52:30,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (2/3) ... [2024-11-10 18:52:30,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38322d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:52:30, skipping insertion in model container [2024-11-10 18:52:30,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:30" (3/3) ... [2024-11-10 18:52:30,679 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build.i [2024-11-10 18:52:30,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:52:30,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-10 18:52:30,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:52:30,819 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;@46b4b38e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:52:30,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-10 18:52:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 18:52:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 18:52:30,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:30,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:30,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -886556446, now seen corresponding path program 1 times [2024-11-10 18:52:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:30,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324778809] [2024-11-10 18:52:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:30,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,037 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 18:52:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324778809] [2024-11-10 18:52:31,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324778809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:31,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697924968] [2024-11-10 18:52:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:31,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:31,066 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 18:52:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:31,189 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2024-11-10 18:52:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:52:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-10 18:52:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:31,204 INFO L225 Difference]: With dead ends: 112 [2024-11-10 18:52:31,204 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 18:52:31,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:52:31,211 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:31,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 18:52:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-11-10 18:52:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-10 18:52:31,258 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 7 [2024-11-10 18:52:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:31,260 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-10 18:52:31,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 18:52:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-10 18:52:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:52:31,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:31,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:31,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:52:31,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:31,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1713447748, now seen corresponding path program 1 times [2024-11-10 18:52:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713130673] [2024-11-10 18:52:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,311 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 18:52:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713130673] [2024-11-10 18:52:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713130673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:31,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76749107] [2024-11-10 18:52:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:31,316 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) 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 18:52:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:31,338 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2024-11-10 18:52:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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 18:52:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:31,341 INFO L225 Difference]: With dead ends: 124 [2024-11-10 18:52:31,341 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 18:52:31,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:52:31,342 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:31,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 18:52:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2024-11-10 18:52:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.4) internal successors, (63), 54 states have internal predecessors, (63), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-11-10 18:52:31,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 8 [2024-11-10 18:52:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:31,363 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-11-10 18:52:31,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) 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 18:52:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-11-10 18:52:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:52:31,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:31,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:31,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:52:31,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:31,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1713446051, now seen corresponding path program 1 times [2024-11-10 18:52:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198821532] [2024-11-10 18:52:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,415 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 18:52:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198821532] [2024-11-10 18:52:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198821532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:31,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232498033] [2024-11-10 18:52:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:31,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:31,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:31,418 INFO L87 Difference]: Start difference. First operand 60 states and 71 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 18:52:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:31,451 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-10 18:52:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:31,452 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 18:52:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:31,453 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:52:31,453 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 18:52:31,454 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 18:52:31,455 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:31,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 18:52:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 18:52:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 52 states have internal predecessors, (59), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2024-11-10 18:52:31,466 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 8 [2024-11-10 18:52:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:31,466 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2024-11-10 18:52:31,466 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 18:52:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2024-11-10 18:52:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:52:31,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:31,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:31,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:52:31,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:31,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1649180741, now seen corresponding path program 1 times [2024-11-10 18:52:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612967319] [2024-11-10 18:52:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,523 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 18:52:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612967319] [2024-11-10 18:52:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612967319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090818231] [2024-11-10 18:52:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:31,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:31,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:31,529 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:31,588 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2024-11-10 18:52:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 18:52:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:31,590 INFO L225 Difference]: With dead ends: 63 [2024-11-10 18:52:31,590 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 18:52:31,590 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 18:52:31,594 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:31,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 50 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 18:52:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2024-11-10 18:52:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:52:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-11-10 18:52:31,604 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 10 [2024-11-10 18:52:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:31,605 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-11-10 18:52:31,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-11-10 18:52:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 18:52:31,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:31,606 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 18:52:31,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:52:31,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:31,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1206704935, now seen corresponding path program 1 times [2024-11-10 18:52:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203085983] [2024-11-10 18:52:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,725 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 18:52:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203085983] [2024-11-10 18:52:31,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203085983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77797649] [2024-11-10 18:52:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:31,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:31,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:31,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:31,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:31,734 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:31,771 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-11-10 18:52:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-10 18:52:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:31,773 INFO L225 Difference]: With dead ends: 92 [2024-11-10 18:52:31,773 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 18:52:31,773 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 18:52:31,774 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:31,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 18:52:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-10 18:52:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 74 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:52:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-11-10 18:52:31,787 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 26 [2024-11-10 18:52:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:31,787 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-11-10 18:52:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:52:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-11-10 18:52:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 18:52:31,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:31,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:31,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:52:31,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:31,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash 839504500, now seen corresponding path program 1 times [2024-11-10 18:52:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419193733] [2024-11-10 18:52:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419193733] [2024-11-10 18:52:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419193733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133977245] [2024-11-10 18:52:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:31,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:31,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:31,910 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 18:52:31,912 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 18:52:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:31,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:52:31,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:32,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:52:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133977245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:32,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 18:52:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73335402] [2024-11-10 18:52:32,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:52:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:52:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:52:32,198 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 18:52:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:32,290 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2024-11-10 18:52:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:52:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2024-11-10 18:52:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:32,293 INFO L225 Difference]: With dead ends: 179 [2024-11-10 18:52:32,293 INFO L226 Difference]: Without dead ends: 130 [2024-11-10 18:52:32,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:52:32,295 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:32,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 161 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-10 18:52:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-11-10 18:52:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 108 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 18:52:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-11-10 18:52:32,317 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 32 [2024-11-10 18:52:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:32,318 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-10 18:52:32,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 18:52:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2024-11-10 18:52:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 18:52:32,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:32,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:32,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:32,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 18:52:32,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:32,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1002511505, now seen corresponding path program 1 times [2024-11-10 18:52:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299143645] [2024-11-10 18:52:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:32,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299143645] [2024-11-10 18:52:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299143645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706894309] [2024-11-10 18:52:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:32,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:32,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:32,691 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 18:52:32,693 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 18:52:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:32,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:52:32,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:52:32,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:52:32,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706894309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:32,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:52:32,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-10 18:52:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752994527] [2024-11-10 18:52:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:32,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:52:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:52:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:52:32,820 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 18:52:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:32,852 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2024-11-10 18:52:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 50 [2024-11-10 18:52:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:32,854 INFO L225 Difference]: With dead ends: 122 [2024-11-10 18:52:32,854 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 18:52:32,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:52:32,858 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:32,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 72 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 18:52:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 18:52:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 107 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 18:52:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2024-11-10 18:52:32,875 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 50 [2024-11-10 18:52:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:32,876 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2024-11-10 18:52:32,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 18:52:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2024-11-10 18:52:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 18:52:32,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:32,878 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 18:52:32,895 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 18:52:33,082 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,SelfDestructingSolverStorable6 [2024-11-10 18:52:33,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1220287683, now seen corresponding path program 1 times [2024-11-10 18:52:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877586021] [2024-11-10 18:52:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-10 18:52:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:33,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877586021] [2024-11-10 18:52:33,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877586021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:33,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:33,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526018332] [2024-11-10 18:52:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:33,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:33,191 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:52:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:33,214 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2024-11-10 18:52:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 75 [2024-11-10 18:52:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:33,216 INFO L225 Difference]: With dead ends: 121 [2024-11-10 18:52:33,216 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 18:52:33,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 18:52:33,217 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:33,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 18:52:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 18:52:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 106 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 18:52:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2024-11-10 18:52:33,233 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 75 [2024-11-10 18:52:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:33,234 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2024-11-10 18:52:33,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:52:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2024-11-10 18:52:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 18:52:33,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:33,239 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:52:33,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:33,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -535771676, now seen corresponding path program 2 times [2024-11-10 18:52:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619892377] [2024-11-10 18:52:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-10 18:52:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619892377] [2024-11-10 18:52:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619892377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:33,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:33,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:52:33,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639142339] [2024-11-10 18:52:33,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:52:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:33,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:52:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:52:33,352 INFO L87 Difference]: Start difference. First operand 120 states and 141 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 18:52:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:33,413 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2024-11-10 18:52:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:52:33,413 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 80 [2024-11-10 18:52:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:33,415 INFO L225 Difference]: With dead ends: 126 [2024-11-10 18:52:33,415 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 18:52:33,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 18:52:33,416 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:33,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 18:52:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-10 18:52:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.1538461538461537) internal successors, (120), 109 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 18:52:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2024-11-10 18:52:33,437 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 80 [2024-11-10 18:52:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:33,438 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2024-11-10 18:52:33,438 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 18:52:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2024-11-10 18:52:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 18:52:33,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:33,442 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:33,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:52:33,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:33,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1695554146, now seen corresponding path program 1 times [2024-11-10 18:52:33,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:33,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184181892] [2024-11-10 18:52:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 18:52:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:33,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184181892] [2024-11-10 18:52:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184181892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:52:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:52:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102317746] [2024-11-10 18:52:33,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:33,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:52:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:52:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:52:33,537 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 18:52:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:33,570 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2024-11-10 18:52:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:52:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 89 [2024-11-10 18:52:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:33,572 INFO L225 Difference]: With dead ends: 123 [2024-11-10 18:52:33,572 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 18:52:33,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 18:52:33,572 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:33,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:52:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 18:52:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 18:52:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 107 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 18:52:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2024-11-10 18:52:33,592 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 89 [2024-11-10 18:52:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:33,593 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2024-11-10 18:52:33,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 18:52:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2024-11-10 18:52:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 18:52:33,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:33,594 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:52:33,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1022570979, now seen corresponding path program 1 times [2024-11-10 18:52:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:33,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421331856] [2024-11-10 18:52:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:33,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 18:52:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421331856] [2024-11-10 18:52:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421331856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036995810] [2024-11-10 18:52:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:33,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:33,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:33,782 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 18:52:33,784 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 18:52:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:33,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:52:33,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 18:52:33,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 18:52:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036995810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:34,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-10 18:52:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172521531] [2024-11-10 18:52:34,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 18:52:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:34,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 18:52:34,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:52:34,123 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 18 states have internal predecessors, (123), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 18:52:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:34,234 INFO L93 Difference]: Finished difference Result 328 states and 375 transitions. [2024-11-10 18:52:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:52:34,236 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 18 states have internal predecessors, (123), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 90 [2024-11-10 18:52:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:34,237 INFO L225 Difference]: With dead ends: 328 [2024-11-10 18:52:34,237 INFO L226 Difference]: Without dead ends: 261 [2024-11-10 18:52:34,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:52:34,240 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:34,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 187 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-10 18:52:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2024-11-10 18:52:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.0833333333333333) internal successors, (234), 219 states have internal predecessors, (234), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 18:52:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 290 transitions. [2024-11-10 18:52:34,260 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 290 transitions. Word has length 90 [2024-11-10 18:52:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:34,261 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 290 transitions. [2024-11-10 18:52:34,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.833333333333333) internal successors, (123), 18 states have internal predecessors, (123), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 18:52:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 290 transitions. [2024-11-10 18:52:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 18:52:34,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:34,268 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:34,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:52:34,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:34,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:34,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 13352189, now seen corresponding path program 2 times [2024-11-10 18:52:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427103361] [2024-11-10 18:52:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 18:52:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 18:52:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:52:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 18:52:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 18:52:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:52:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 18:52:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 18:52:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 350 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 18:52:34,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:34,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427103361] [2024-11-10 18:52:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427103361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:34,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666089521] [2024-11-10 18:52:34,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:52:34,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:34,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:34,883 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 18:52:34,885 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 18:52:34,964 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:52:34,965 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:34,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 18:52:34,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 350 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 18:52:35,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 350 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 18:52:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666089521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:35,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2024-11-10 18:52:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232267536] [2024-11-10 18:52:35,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 18:52:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 18:52:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-10 18:52:35,507 INFO L87 Difference]: Start difference. First operand 249 states and 290 transitions. Second operand has 19 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-10 18:52:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:35,611 INFO L93 Difference]: Finished difference Result 426 states and 487 transitions. [2024-11-10 18:52:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 18:52:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 186 [2024-11-10 18:52:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:35,614 INFO L225 Difference]: With dead ends: 426 [2024-11-10 18:52:35,614 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 18:52:35,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 383 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-10 18:52:35,616 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:35,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 215 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 18:52:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2024-11-10 18:52:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 244 states have (on average 1.0819672131147542) internal successors, (264), 247 states have internal predecessors, (264), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 18:52:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 328 transitions. [2024-11-10 18:52:35,633 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 328 transitions. Word has length 186 [2024-11-10 18:52:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:35,633 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 328 transitions. [2024-11-10 18:52:35,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.052631578947368) internal successors, (134), 19 states have internal predecessors, (134), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-10 18:52:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 328 transitions. [2024-11-10 18:52:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 18:52:35,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:35,636 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:35,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:52:35,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:35,837 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:35,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -222735179, now seen corresponding path program 3 times [2024-11-10 18:52:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:35,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863865738] [2024-11-10 18:52:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:35,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 18:52:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 18:52:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:52:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 18:52:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 18:52:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:52:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 18:52:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 18:52:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 18:52:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-11-10 18:52:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863865738] [2024-11-10 18:52:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863865738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946750103] [2024-11-10 18:52:36,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:52:36,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:36,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:36,070 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 18:52:36,072 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 18:52:36,113 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 18:52:36,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:36,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:36,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-11-10 18:52:36,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:52:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946750103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:52:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:52:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-10 18:52:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521210528] [2024-11-10 18:52:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:52:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:52:36,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:52:36,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:36,654 INFO L87 Difference]: Start difference. First operand 281 states and 328 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 18:52:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:36,730 INFO L93 Difference]: Finished difference Result 281 states and 328 transitions. [2024-11-10 18:52:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:52:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 210 [2024-11-10 18:52:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:36,734 INFO L225 Difference]: With dead ends: 281 [2024-11-10 18:52:36,734 INFO L226 Difference]: Without dead ends: 278 [2024-11-10 18:52:36,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:52:36,735 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:36,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 69 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-10 18:52:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-10 18:52:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 244 states have (on average 1.0122950819672132) internal successors, (247), 244 states have internal predecessors, (247), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 18:52:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2024-11-10 18:52:36,757 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 210 [2024-11-10 18:52:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:36,758 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2024-11-10 18:52:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 18:52:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2024-11-10 18:52:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-10 18:52:36,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:36,764 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 18:52:36,780 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 18:52:36,964 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,SelfDestructingSolverStorable12 [2024-11-10 18:52:36,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1324366000, now seen corresponding path program 1 times [2024-11-10 18:52:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886080066] [2024-11-10 18:52:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 18:52:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 18:52:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:52:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 18:52:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 18:52:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:52:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 18:52:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 18:52:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 18:52:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 18:52:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-10 18:52:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-10 18:52:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 18:52:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 18:52:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 18:52:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-10 18:52:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-10 18:52:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-10 18:52:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-10 18:52:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-10 18:52:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-10 18:52:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-10 18:52:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-10 18:52:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-10 18:52:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-10 18:52:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3975 backedges. 0 proven. 1063 refuted. 0 times theorem prover too weak. 2912 trivial. 0 not checked. [2024-11-10 18:52:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886080066] [2024-11-10 18:52:37,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886080066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743893884] [2024-11-10 18:52:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:37,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:37,349 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 18:52:37,350 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 18:52:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:37,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:52:37,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3975 backedges. 0 proven. 1063 refuted. 0 times theorem prover too weak. 2912 trivial. 0 not checked. [2024-11-10 18:52:37,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3975 backedges. 0 proven. 1063 refuted. 0 times theorem prover too weak. 2912 trivial. 0 not checked. [2024-11-10 18:52:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743893884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:38,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:38,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:52:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383902915] [2024-11-10 18:52:38,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:38,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:52:38,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:52:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:52:38,268 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 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 18:52:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:38,395 INFO L93 Difference]: Finished difference Result 687 states and 773 transitions. [2024-11-10 18:52:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:52:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 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 401 [2024-11-10 18:52:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:38,401 INFO L225 Difference]: With dead ends: 687 [2024-11-10 18:52:38,401 INFO L226 Difference]: Without dead ends: 686 [2024-11-10 18:52:38,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 859 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:52:38,402 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:38,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-10 18:52:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-11-10 18:52:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 604 states have (on average 1.009933774834437) internal successors, (610), 604 states have internal predecessors, (610), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-10 18:52:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 770 transitions. [2024-11-10 18:52:38,438 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 770 transitions. Word has length 401 [2024-11-10 18:52:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 770 transitions. [2024-11-10 18:52:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 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 18:52:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 770 transitions. [2024-11-10 18:52:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2024-11-10 18:52:38,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:52:38,463 INFO L215 NwaCegarLoop]: trace histogram [80, 80, 80, 45, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-11-10 18:52:38,482 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 18:52:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:38,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-11-10 18:52:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:52:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash 875900930, now seen corresponding path program 2 times [2024-11-10 18:52:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:52:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369284957] [2024-11-10 18:52:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:52:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:52:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 18:52:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:52:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 18:52:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:52:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:52:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 18:52:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 18:52:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 18:52:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 18:52:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 18:52:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 18:52:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 18:52:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 18:52:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 18:52:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 18:52:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 18:52:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-10 18:52:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-10 18:52:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-10 18:52:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 18:52:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 18:52:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 18:52:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-10 18:52:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-10 18:52:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-10 18:52:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-10 18:52:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-11-10 18:52:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-10 18:52:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-11-10 18:52:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-10 18:52:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-10 18:52:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-10 18:52:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-11-10 18:52:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-10 18:52:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2024-11-10 18:52:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-10 18:52:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-11-10 18:52:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-10 18:52:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-11-10 18:52:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2024-11-10 18:52:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2024-11-10 18:52:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 515 [2024-11-10 18:52:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 18:52:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-10 18:52:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 554 [2024-11-10 18:52:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-11-10 18:52:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 578 [2024-11-10 18:52:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-11-10 18:52:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 610 [2024-11-10 18:52:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 619 [2024-11-10 18:52:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2024-11-10 18:52:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 643 [2024-11-10 18:52:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-11-10 18:52:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 667 [2024-11-10 18:52:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 682 [2024-11-10 18:52:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 691 [2024-11-10 18:52:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 706 [2024-11-10 18:52:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 715 [2024-11-10 18:52:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 730 [2024-11-10 18:52:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 739 [2024-11-10 18:52:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 754 [2024-11-10 18:52:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2024-11-10 18:52:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 778 [2024-11-10 18:52:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 787 [2024-11-10 18:52:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 810 [2024-11-10 18:52:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2024-11-10 18:52:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 834 [2024-11-10 18:52:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 843 [2024-11-10 18:52:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 858 [2024-11-10 18:52:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 867 [2024-11-10 18:52:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 882 [2024-11-10 18:52:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 891 [2024-11-10 18:52:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 906 [2024-11-10 18:52:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 915 [2024-11-10 18:52:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 930 [2024-11-10 18:52:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 939 [2024-11-10 18:52:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 954 [2024-11-10 18:52:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 963 [2024-11-10 18:52:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 978 [2024-11-10 18:52:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 987 [2024-11-10 18:52:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:52:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25596 backedges. 0 proven. 10636 refuted. 0 times theorem prover too weak. 14960 trivial. 0 not checked. [2024-11-10 18:52:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:52:39,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369284957] [2024-11-10 18:52:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369284957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:52:39,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666146944] [2024-11-10 18:52:39,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:52:39,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:52:39,947 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 18:52:39,973 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 18:52:40,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:52:40,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:52:40,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:52:40,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:52:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25596 backedges. 0 proven. 4244 refuted. 0 times theorem prover too weak. 21352 trivial. 0 not checked. [2024-11-10 18:52:40,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:52:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 25596 backedges. 0 proven. 4244 refuted. 0 times theorem prover too weak. 21352 trivial. 0 not checked. [2024-11-10 18:52:41,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666146944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:52:41,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:52:41,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2024-11-10 18:52:41,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88661402] [2024-11-10 18:52:41,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:52:41,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 18:52:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:52:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 18:52:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:52:41,991 INFO L87 Difference]: Start difference. First operand 686 states and 770 transitions. Second operand has 15 states, 14 states have (on average 10.714285714285714) internal successors, (150), 15 states have internal predecessors, (150), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 18:52:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:52:42,232 INFO L93 Difference]: Finished difference Result 825 states and 927 transitions. [2024-11-10 18:52:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:52:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.714285714285714) internal successors, (150), 15 states have internal predecessors, (150), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 1001 [2024-11-10 18:52:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:52:42,234 INFO L225 Difference]: With dead ends: 825 [2024-11-10 18:52:42,235 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:52:42,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2183 GetRequests, 2156 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-10 18:52:42,239 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:52:42,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:52:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:52:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:52:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:52:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:52:42,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1001 [2024-11-10 18:52:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:52:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:52:42,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.714285714285714) internal successors, (150), 15 states have internal predecessors, (150), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-10 18:52:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:52:42,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:52:42,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-11-10 18:52:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-11-10 18:52:42,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-11-10 18:52:42,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-11-10 18:52:42,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-11-10 18:52:42,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-11-10 18:52:42,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-11-10 18:52:42,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:52:42,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:52:42,454 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:52:42,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:52:44,038 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:52:44,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:52:44 BoogieIcfgContainer [2024-11-10 18:52:44,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:52:44,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:52:44,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:52:44,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:52:44,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:52:30" (3/4) ... [2024-11-10 18:52:44,057 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:52:44,060 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 18:52:44,066 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-10 18:52:44,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:52:44,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:52:44,067 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:52:44,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:52:44,156 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:52:44,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:52:44,157 INFO L158 Benchmark]: Toolchain (without parser) took 14177.38ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 96.5MB in the beginning and 269.2MB in the end (delta: -172.7MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,157 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:52:44,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.21ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 83.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.80ms. Allocated memory is still 151.0MB. Free memory was 83.8MB in the beginning and 82.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:52:44,158 INFO L158 Benchmark]: Boogie Preprocessor took 41.65ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,158 INFO L158 Benchmark]: IcfgBuilder took 323.91ms. Allocated memory is still 151.0MB. Free memory was 80.9MB in the beginning and 69.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,158 INFO L158 Benchmark]: TraceAbstraction took 13382.78ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 68.3MB in the beginning and 274.5MB in the end (delta: -206.1MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,158 INFO L158 Benchmark]: Witness Printer took 102.00ms. Allocated memory is still 388.0MB. Free memory was 274.5MB in the beginning and 269.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:52:44,163 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.21ms. Allocated memory is still 151.0MB. Free memory was 96.3MB in the beginning and 83.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.80ms. Allocated memory is still 151.0MB. Free memory was 83.8MB in the beginning and 82.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.65ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 323.91ms. Allocated memory is still 151.0MB. Free memory was 80.9MB in the beginning and 69.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13382.78ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 68.3MB in the beginning and 274.5MB in the end (delta: -206.1MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. * Witness Printer took 102.00ms. Allocated memory is still 388.0MB. Free memory was 274.5MB in the beginning and 269.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 15, TraceHistogramMax: 80, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 1492 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 423 mSDtfsCounter, 682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4106 GetRequests, 3987 SyntacticMatches, 17 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=14, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 77 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 4243 NumberOfCodeBlocks, 3059 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5926 ConstructedInterpolants, 0 QuantifiedInterpolants, 14810 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1241 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 70247/93844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: null - InvariantResult [Line: 28]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:52:44,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE