./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.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 b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:24:31,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:24:31,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:24:31,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:24:31,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:24:31,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:24:31,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:24:31,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:24:31,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:24:31,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:24:31,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:24:31,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:24:31,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:24:31,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:24:31,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:24:31,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:24:31,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:24:31,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:24:31,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:24:31,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:24:31,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:24:31,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:24:31,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:24:31,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:24:31,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:24:31,531 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:24:31,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:24:31,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:24:31,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:24:31,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:24:31,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:24:31,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:24:31,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:24:31,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:24:31,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:24:31,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:24:31,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:24:31,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:24:31,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:24:31,535 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2024-10-14 20:24:31,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:24:31,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:24:31,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:24:31,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:24:31,779 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:24:31,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-10-14 20:24:32,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:24:33,114 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:24:33,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-10-14 20:24:33,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c195d0dc8/b327daa6506a4da2b5df9352b1685824/FLAGf3d877e89 [2024-10-14 20:24:33,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c195d0dc8/b327daa6506a4da2b5df9352b1685824 [2024-10-14 20:24:33,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:24:33,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:24:33,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:24:33,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:24:33,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:24:33,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6c13cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33, skipping insertion in model container [2024-10-14 20:24:33,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:24:33,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:24:33,355 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:24:33,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:24:33,400 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:24:33,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33 WrapperNode [2024-10-14 20:24:33,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:24:33,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:24:33,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:24:33,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:24:33,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,440 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 160 [2024-10-14 20:24:33,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:24:33,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:24:33,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:24:33,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:24:33,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,473 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-10-14 20:24:33,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:24:33,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:24:33,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:24:33,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:24:33,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (1/1) ... [2024-10-14 20:24:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:24:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:33,518 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-10-14 20:24:33,524 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-10-14 20:24:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:24:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:24:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:24:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:24:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:24:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:24:33,609 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:24:33,611 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:24:33,821 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-14 20:24:33,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:24:33,853 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:24:33,854 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:24:33,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:33 BoogieIcfgContainer [2024-10-14 20:24:33,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:24:33,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:24:33,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:24:33,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:24:33,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:24:33" (1/3) ... [2024-10-14 20:24:33,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d4f3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:24:33, skipping insertion in model container [2024-10-14 20:24:33,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:24:33" (2/3) ... [2024-10-14 20:24:33,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d4f3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:24:33, skipping insertion in model container [2024-10-14 20:24:33,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:33" (3/3) ... [2024-10-14 20:24:33,862 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-10-14 20:24:33,876 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:24:33,876 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-14 20:24:33,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:24:33,931 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;@710b3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:24:33,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-10-14 20:24:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:24:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 20:24:33,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:33,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:33,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2024-10-14 20:24:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937067704] [2024-10-14 20:24:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937067704] [2024-10-14 20:24:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937067704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286887105] [2024-10-14 20:24:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:34,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:34,122 INFO L87 Difference]: Start difference. First operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:34,208 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2024-10-14 20:24:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 20:24:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:34,216 INFO L225 Difference]: With dead ends: 193 [2024-10-14 20:24:34,217 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 20:24:34,219 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-10-14 20:24:34,221 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:34,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 20:24:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 20:24:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 80 states have internal predecessors, (83), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:24:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-10-14 20:24:34,254 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 9 [2024-10-14 20:24:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-14 20:24:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2024-10-14 20:24:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:24:34,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:34,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:34,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:24:34,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2024-10-14 20:24:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:34,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715987673] [2024-10-14 20:24:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715987673] [2024-10-14 20:24:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715987673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:34,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616281004] [2024-10-14 20:24:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:34,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:34,283 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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-10-14 20:24:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:34,304 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2024-10-14 20:24:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-10-14 20:24:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:34,308 INFO L225 Difference]: With dead ends: 183 [2024-10-14 20:24:34,309 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 20:24:34,310 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-10-14 20:24:34,311 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 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-10-14 20:24:34,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 20:24:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 20:24:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 80 states have internal predecessors, (82), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:24:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-14 20:24:34,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 10 [2024-10-14 20:24:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-14 20:24:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-10-14 20:24:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-14 20:24:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:24:34,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:34,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:34,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:24:34,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2024-10-14 20:24:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176277680] [2024-10-14 20:24:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176277680] [2024-10-14 20:24:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176277680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:24:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024851726] [2024-10-14 20:24:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:34,370 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-10-14 20:24:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:34,407 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2024-10-14 20:24:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-10-14 20:24:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:34,408 INFO L225 Difference]: With dead ends: 97 [2024-10-14 20:24:34,408 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 20:24:34,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 20:24:34,409 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:34,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 116 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 20:24:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 20:24:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:24:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2024-10-14 20:24:34,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 10 [2024-10-14 20:24:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:34,427 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2024-10-14 20:24:34,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-10-14 20:24:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2024-10-14 20:24:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:24:34,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:34,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:34,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:24:34,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2024-10-14 20:24:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214225084] [2024-10-14 20:24:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:34,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214225084] [2024-10-14 20:24:34,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214225084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:34,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:34,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848464434] [2024-10-14 20:24:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:34,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:24:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:34,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:24:34,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:34,485 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:24:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:34,584 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-10-14 20:24:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:24:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-14 20:24:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:34,586 INFO L225 Difference]: With dead ends: 92 [2024-10-14 20:24:34,586 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 20:24:34,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:34,588 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 44 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:34,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 169 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 20:24:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 20:24:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 67 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:24:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-14 20:24:34,603 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 12 [2024-10-14 20:24:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:34,603 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-14 20:24:34,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 20:24:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-14 20:24:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:24:34,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:34,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:34,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:24:34,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:34,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2024-10-14 20:24:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054456878] [2024-10-14 20:24:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:24:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054456878] [2024-10-14 20:24:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054456878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:34,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:34,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042658593] [2024-10-14 20:24:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:34,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:24:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:24:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:34,648 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:34,717 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2024-10-14 20:24:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:24:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 20:24:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:34,719 INFO L225 Difference]: With dead ends: 115 [2024-10-14 20:24:34,720 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 20:24:34,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:24:34,721 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 25 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:34,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 223 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 20:24:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-14 20:24:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 20:24:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-10-14 20:24:34,751 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 13 [2024-10-14 20:24:34,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-10-14 20:24:34,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:24:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-10-14 20:24:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 20:24:34,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:34,754 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:24:34,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:34,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -206244278, now seen corresponding path program 1 times [2024-10-14 20:24:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836147690] [2024-10-14 20:24:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:24:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:24:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836147690] [2024-10-14 20:24:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836147690] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371864373] [2024-10-14 20:24:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:34,992 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-10-14 20:24:34,996 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-10-14 20:24:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:35,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:24:35,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:35,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 20:24:35,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371864373] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:35,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-10-14 20:24:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526298014] [2024-10-14 20:24:35,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:35,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:24:35,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:24:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:24:35,276 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-14 20:24:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:35,725 INFO L93 Difference]: Finished difference Result 322 states and 447 transitions. [2024-10-14 20:24:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:24:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 69 [2024-10-14 20:24:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:35,728 INFO L225 Difference]: With dead ends: 322 [2024-10-14 20:24:35,728 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 20:24:35,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:24:35,729 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 503 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:35,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 426 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:24:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 20:24:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 282. [2024-10-14 20:24:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 211 states have internal predecessors, (241), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 20:24:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2024-10-14 20:24:35,773 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 69 [2024-10-14 20:24:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:35,773 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2024-10-14 20:24:35,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-10-14 20:24:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2024-10-14 20:24:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 20:24:35,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:35,781 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:35,794 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-10-14 20:24:35,984 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-10-14 20:24:35,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:35,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1693853084, now seen corresponding path program 1 times [2024-10-14 20:24:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:35,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377125196] [2024-10-14 20:24:35,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:35,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 20:24:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 20:24:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 20:24:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:24:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 20:24:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 20:24:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 20:24:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377125196] [2024-10-14 20:24:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377125196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764996297] [2024-10-14 20:24:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:36,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:36,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:36,053 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 20:24:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:36,109 INFO L93 Difference]: Finished difference Result 402 states and 578 transitions. [2024-10-14 20:24:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-14 20:24:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:36,112 INFO L225 Difference]: With dead ends: 402 [2024-10-14 20:24:36,112 INFO L226 Difference]: Without dead ends: 282 [2024-10-14 20:24:36,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-10-14 20:24:36,116 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:36,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-14 20:24:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-14 20:24:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.1989795918367347) internal successors, (235), 211 states have internal predecessors, (235), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 20:24:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 391 transitions. [2024-10-14 20:24:36,139 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 391 transitions. Word has length 89 [2024-10-14 20:24:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 391 transitions. [2024-10-14 20:24:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 20:24:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 391 transitions. [2024-10-14 20:24:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 20:24:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:36,141 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:36,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:24:36,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1071833793, now seen corresponding path program 1 times [2024-10-14 20:24:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813928592] [2024-10-14 20:24:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 20:24:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813928592] [2024-10-14 20:24:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813928592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765033187] [2024-10-14 20:24:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:36,214 INFO L87 Difference]: Start difference. First operand 282 states and 391 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 20:24:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:36,234 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2024-10-14 20:24:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 90 [2024-10-14 20:24:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:36,238 INFO L225 Difference]: With dead ends: 282 [2024-10-14 20:24:36,238 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 20:24:36,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-10-14 20:24:36,239 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:36,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 114 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 20:24:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-14 20:24:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.1734693877551021) internal successors, (230), 210 states have internal predecessors, (230), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 20:24:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2024-10-14 20:24:36,261 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 90 [2024-10-14 20:24:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:36,262 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2024-10-14 20:24:36,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 20:24:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2024-10-14 20:24:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 20:24:36,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:36,264 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:36,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:24:36,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890603, now seen corresponding path program 1 times [2024-10-14 20:24:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434924617] [2024-10-14 20:24:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 20:24:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434924617] [2024-10-14 20:24:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434924617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79747392] [2024-10-14 20:24:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:36,355 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 20:24:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:36,381 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2024-10-14 20:24:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2024-10-14 20:24:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:36,385 INFO L225 Difference]: With dead ends: 281 [2024-10-14 20:24:36,385 INFO L226 Difference]: Without dead ends: 280 [2024-10-14 20:24:36,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-10-14 20:24:36,386 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:36,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-14 20:24:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-10-14 20:24:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1479591836734695) internal successors, (225), 209 states have internal predecessors, (225), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 20:24:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2024-10-14 20:24:36,409 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 91 [2024-10-14 20:24:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2024-10-14 20:24:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 20:24:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2024-10-14 20:24:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 20:24:36,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:36,411 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:36,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:24:36,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2010672774, now seen corresponding path program 1 times [2024-10-14 20:24:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942848074] [2024-10-14 20:24:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 20:24:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 20:24:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:24:36,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942848074] [2024-10-14 20:24:36,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942848074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:36,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:36,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:24:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997891025] [2024-10-14 20:24:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:36,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:36,478 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:24:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:36,496 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2024-10-14 20:24:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-14 20:24:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:36,498 INFO L225 Difference]: With dead ends: 376 [2024-10-14 20:24:36,498 INFO L226 Difference]: Without dead ends: 280 [2024-10-14 20:24:36,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-10-14 20:24:36,498 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:36,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-14 20:24:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-10-14 20:24:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 209 states have internal predecessors, (220), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 20:24:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2024-10-14 20:24:36,513 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 103 [2024-10-14 20:24:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:36,514 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2024-10-14 20:24:36,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:24:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2024-10-14 20:24:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 20:24:36,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:36,515 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:36,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:24:36,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:36,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2146032074, now seen corresponding path program 1 times [2024-10-14 20:24:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:36,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22760218] [2024-10-14 20:24:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:24:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:24:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:24:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22760218] [2024-10-14 20:24:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22760218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:36,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:24:36,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:24:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954129001] [2024-10-14 20:24:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:36,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:24:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:24:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:24:36,578 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:24:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:36,601 INFO L93 Difference]: Finished difference Result 341 states and 455 transitions. [2024-10-14 20:24:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:24:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-14 20:24:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:36,603 INFO L225 Difference]: With dead ends: 341 [2024-10-14 20:24:36,604 INFO L226 Difference]: Without dead ends: 339 [2024-10-14 20:24:36,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-10-14 20:24:36,604 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:36,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-14 20:24:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2024-10-14 20:24:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 258 states have internal predecessors, (273), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-14 20:24:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2024-10-14 20:24:36,622 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 105 [2024-10-14 20:24:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:36,622 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2024-10-14 20:24:36,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:24:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2024-10-14 20:24:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 20:24:36,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:36,624 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 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-10-14 20:24:36,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:24:36,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2135030018, now seen corresponding path program 2 times [2024-10-14 20:24:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580885747] [2024-10-14 20:24:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:24:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:24:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:24:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:24:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 20:24:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 20:24:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 20:24:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 20:24:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 20:24:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 20:24:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 20:24:36,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580885747] [2024-10-14 20:24:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580885747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476613854] [2024-10-14 20:24:36,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:24:36,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:36,802 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-10-14 20:24:36,803 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-10-14 20:24:36,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:24:36,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:24:36,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 20:24:36,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 20:24:36,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 20:24:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476613854] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:37,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-14 20:24:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228433374] [2024-10-14 20:24:37,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:37,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 20:24:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:37,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 20:24:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:24:37,143 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-14 20:24:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:38,065 INFO L93 Difference]: Finished difference Result 788 states and 1047 transitions. [2024-10-14 20:24:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 20:24:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 133 [2024-10-14 20:24:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:38,069 INFO L225 Difference]: With dead ends: 788 [2024-10-14 20:24:38,069 INFO L226 Difference]: Without dead ends: 785 [2024-10-14 20:24:38,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2024-10-14 20:24:38,070 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2050 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:38,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 435 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 20:24:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-14 20:24:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2024-10-14 20:24:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 561 states have (on average 1.1105169340463459) internal successors, (623), 587 states have internal predecessors, (623), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-10-14 20:24:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1019 transitions. [2024-10-14 20:24:38,101 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1019 transitions. Word has length 133 [2024-10-14 20:24:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:38,101 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1019 transitions. [2024-10-14 20:24:38,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2024-10-14 20:24:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1019 transitions. [2024-10-14 20:24:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-14 20:24:38,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:38,103 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:38,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:24:38,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 20:24:38,309 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1539023991, now seen corresponding path program 1 times [2024-10-14 20:24:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597940702] [2024-10-14 20:24:38,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:38,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:24:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:24:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 20:24:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 20:24:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 20:24:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 20:24:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 20:24:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:24:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 20:24:38,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597940702] [2024-10-14 20:24:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597940702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663800362] [2024-10-14 20:24:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:38,431 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-10-14 20:24:38,431 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-10-14 20:24:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:24:38,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 20:24:38,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:24:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663800362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:24:38,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:24:38,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-14 20:24:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421618229] [2024-10-14 20:24:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:24:38,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:24:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:38,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:24:38,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:24:38,529 INFO L87 Difference]: Start difference. First operand 765 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-14 20:24:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:38,567 INFO L93 Difference]: Finished difference Result 766 states and 1019 transitions. [2024-10-14 20:24:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:24:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2024-10-14 20:24:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:38,571 INFO L225 Difference]: With dead ends: 766 [2024-10-14 20:24:38,571 INFO L226 Difference]: Without dead ends: 765 [2024-10-14 20:24:38,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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-10-14 20:24:38,571 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:38,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 186 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-14 20:24:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2024-10-14 20:24:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 561 states have (on average 1.0909090909090908) internal successors, (612), 586 states have internal predecessors, (612), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2024-10-14 20:24:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1008 transitions. [2024-10-14 20:24:38,604 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1008 transitions. Word has length 147 [2024-10-14 20:24:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:38,604 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1008 transitions. [2024-10-14 20:24:38,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-14 20:24:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1008 transitions. [2024-10-14 20:24:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-14 20:24:38,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:38,606 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:38,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:24:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:38,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:38,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 465103665, now seen corresponding path program 1 times [2024-10-14 20:24:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922357334] [2024-10-14 20:24:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:24:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:24:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 20:24:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 20:24:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 20:24:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 20:24:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 20:24:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:24:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 20:24:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922357334] [2024-10-14 20:24:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922357334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912499602] [2024-10-14 20:24:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:38,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:38,917 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-10-14 20:24:38,918 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-10-14 20:24:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:38,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:24:38,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 20:24:39,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 20:24:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912499602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:39,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 20:24:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071347953] [2024-10-14 20:24:39,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:24:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:24:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:24:39,088 INFO L87 Difference]: Start difference. First operand 764 states and 1008 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-10-14 20:24:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:39,173 INFO L93 Difference]: Finished difference Result 1273 states and 1743 transitions. [2024-10-14 20:24:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:24:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 148 [2024-10-14 20:24:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:39,179 INFO L225 Difference]: With dead ends: 1273 [2024-10-14 20:24:39,179 INFO L226 Difference]: Without dead ends: 1272 [2024-10-14 20:24:39,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:24:39,180 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:39,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 289 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:24:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-10-14 20:24:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1268. [2024-10-14 20:24:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 891 states have (on average 1.0875420875420876) internal successors, (969), 943 states have internal predecessors, (969), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2024-10-14 20:24:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1713 transitions. [2024-10-14 20:24:39,238 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1713 transitions. Word has length 148 [2024-10-14 20:24:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:39,238 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1713 transitions. [2024-10-14 20:24:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2024-10-14 20:24:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1713 transitions. [2024-10-14 20:24:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-14 20:24:39,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:39,243 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 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-10-14 20:24:39,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:24:39,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:39,443 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:39,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash -591541447, now seen corresponding path program 3 times [2024-10-14 20:24:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565269748] [2024-10-14 20:24:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:39,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:24:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:24:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:24:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:24:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 20:24:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 20:24:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 20:24:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 20:24:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 20:24:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 20:24:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 20:24:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 20:24:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 20:24:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 20:24:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 20:24:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 20:24:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 20:24:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 20:24:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 20:24:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 20:24:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 20:24:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 20:24:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-14 20:24:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-14 20:24:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 20:24:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565269748] [2024-10-14 20:24:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565269748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643939915] [2024-10-14 20:24:39,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:24:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:39,861 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-10-14 20:24:39,862 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-10-14 20:24:39,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 20:24:39,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:24:39,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 20:24:39,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-14 20:24:40,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-10-14 20:24:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643939915] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:40,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2024-10-14 20:24:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21139396] [2024-10-14 20:24:40,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 20:24:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 20:24:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2024-10-14 20:24:40,346 INFO L87 Difference]: Start difference. First operand 1268 states and 1713 transitions. Second operand has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-10-14 20:24:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:40,676 INFO L93 Difference]: Finished difference Result 1345 states and 1801 transitions. [2024-10-14 20:24:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:24:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 245 [2024-10-14 20:24:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:40,684 INFO L225 Difference]: With dead ends: 1345 [2024-10-14 20:24:40,684 INFO L226 Difference]: Without dead ends: 1342 [2024-10-14 20:24:40,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2024-10-14 20:24:40,686 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 147 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:40,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 234 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:24:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-10-14 20:24:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 141. [2024-10-14 20:24:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 107 states have internal predecessors, (108), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 20:24:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2024-10-14 20:24:40,726 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 245 [2024-10-14 20:24:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:40,727 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2024-10-14 20:24:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2024-10-14 20:24:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2024-10-14 20:24:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-14 20:24:40,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:24:40,729 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 20:24:40,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:24:40,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 20:24:40,931 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2024-10-14 20:24:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:24:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -958996402, now seen corresponding path program 2 times [2024-10-14 20:24:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:24:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612894566] [2024-10-14 20:24:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:24:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:24:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 20:24:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 20:24:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:24:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:24:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:24:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:24:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:24:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:24:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:24:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 20:24:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:24:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:24:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 20:24:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 20:24:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 20:24:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 20:24:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 20:24:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:24:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 20:24:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 20:24:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 20:24:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 20:24:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 20:24:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-14 20:24:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 20:24:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 20:24:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 20:24:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 20:24:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-14 20:24:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-14 20:24:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 20:24:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 20:24:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-14 20:24:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 20:24:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 20:24:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 20:24:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:24:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2024-10-14 20:24:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:24:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612894566] [2024-10-14 20:24:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612894566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:24:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890621682] [2024-10-14 20:24:41,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:24:41,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:24:41,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:24:41,131 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-10-14 20:24:41,132 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-10-14 20:24:41,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:24:41,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:24:41,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:24:41,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:24:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:24:41,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:24:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:24:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890621682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:24:41,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:24:41,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-10-14 20:24:41,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522663086] [2024-10-14 20:24:41,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:24:41,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 20:24:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:24:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 20:24:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:24:41,524 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-10-14 20:24:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:24:41,662 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2024-10-14 20:24:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:24:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 274 [2024-10-14 20:24:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:24:41,663 INFO L225 Difference]: With dead ends: 171 [2024-10-14 20:24:41,663 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:24:41,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2024-10-14 20:24:41,664 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:24:41,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 286 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:24:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:24:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:24:41,665 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-10-14 20:24:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:24:41,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2024-10-14 20:24:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:24:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:24:41,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2024-10-14 20:24:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:24:41,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:24:41,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2024-10-14 20:24:41,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2024-10-14 20:24:41,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2024-10-14 20:24:41,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2024-10-14 20:24:41,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2024-10-14 20:24:41,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 20:24:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 20:24:41,875 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:24:41,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:24:42,734 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:24:42,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:24:42 BoogieIcfgContainer [2024-10-14 20:24:42,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:24:42,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:24:42,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:24:42,750 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:24:42,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:24:33" (3/4) ... [2024-10-14 20:24:42,751 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:24:42,753 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:24:42,759 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 20:24:42,760 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:24:42,760 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:24:42,760 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:24:42,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:24:42,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:24:42,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:24:42,846 INFO L158 Benchmark]: Toolchain (without parser) took 9703.40ms. Allocated memory was 176.2MB in the beginning and 375.4MB in the end (delta: 199.2MB). Free memory was 108.9MB in the beginning and 259.0MB in the end (delta: -150.1MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,846 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:24:42,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.08ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 146.3MB in the end (delta: -37.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,847 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 142.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,847 INFO L158 Benchmark]: RCFGBuilder took 369.43ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 123.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,847 INFO L158 Benchmark]: TraceAbstraction took 8892.69ms. Allocated memory was 176.2MB in the beginning and 375.4MB in the end (delta: 199.2MB). Free memory was 122.8MB in the beginning and 265.3MB in the end (delta: -142.5MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,848 INFO L158 Benchmark]: Witness Printer took 96.52ms. Allocated memory is still 375.4MB. Free memory was 265.3MB in the beginning and 259.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:24:42,849 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.77ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.08ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 146.3MB in the end (delta: -37.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 142.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.43ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 123.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8892.69ms. Allocated memory was 176.2MB in the beginning and 375.4MB in the end (delta: 199.2MB). Free memory was 122.8MB in the beginning and 265.3MB in the end (delta: -142.5MB). Peak memory consumption was 160.1MB. Max. memory is 16.1GB. * Witness Printer took 96.52ms. Allocated memory is still 375.4MB. Free memory was 265.3MB in the beginning and 259.0MB in the end (delta: 6.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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: 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, 107 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3139 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3029 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2086 mSDsCounter, 1193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1689 IncrementalHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1193 mSolverCounterUnsat, 1387 mSDtfsCounter, 1689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2333 GetRequests, 2216 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1261 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2564 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6197 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 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 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 999999)) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (1 <= c)) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (c <= 2147483642)) && (tokenlen <= 1000000)) || (((((((c == 0) && (urilen <= 1000000)) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (tokenlen <= 1000000))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:24:42,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE