./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:34:37,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:34:37,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:34:37,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:34:37,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:34:37,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:34:37,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:34:37,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:34:37,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:34:37,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:34:37,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:34:37,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:34:37,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:34:37,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:34:37,539 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:34:37,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:34:37,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:34:37,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:34:37,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:34:37,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:34:37,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:34:37,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:34:37,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:34:37,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:34:37,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:34:37,542 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:34:37,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:34:37,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:34:37,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:34:37,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:34:37,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:34:37,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:34:37,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:34:37,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:34:37,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:34:37,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:34:37,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:34:37,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:34:37,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:34:37,546 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-clean/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-clean/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 -> 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae [2024-10-11 20:34:37,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:34:37,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:34:37,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:34:37,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:34:37,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:34:37,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2024-10-11 20:34:39,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:34:39,227 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:34:39,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2024-10-11 20:34:39,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8c037323b/c54fc16eb37e4776ab1fed33c55208b4/FLAG658c97af7 [2024-10-11 20:34:39,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8c037323b/c54fc16eb37e4776ab1fed33c55208b4 [2024-10-11 20:34:39,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:34:39,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:34:39,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:34:39,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:34:39,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:34:39,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e98c187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39, skipping insertion in model container [2024-10-11 20:34:39,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:34:39,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:34:39,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:34:39,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:34:39,505 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:34:39,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39 WrapperNode [2024-10-11 20:34:39,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:34:39,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:34:39,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:34:39,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:34:39,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,539 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-10-11 20:34:39,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:34:39,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:34:39,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:34:39,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:34:39,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,572 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-11 20:34:39,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:34:39,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:34:39,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:34:39,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:34:39,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (1/1) ... [2024-10-11 20:34:39,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:34:39,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:39,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:34:39,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:34:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:34:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:34:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:34:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:34:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:34:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:34:39,700 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:34:39,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:34:39,929 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-11 20:34:39,929 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:34:39,950 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:34:39,950 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:34:39,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:34:39 BoogieIcfgContainer [2024-10-11 20:34:39,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:34:39,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:34:39,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:34:39,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:34:39,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:34:39" (1/3) ... [2024-10-11 20:34:39,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec818af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:34:39, skipping insertion in model container [2024-10-11 20:34:39,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:34:39" (2/3) ... [2024-10-11 20:34:39,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec818af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:34:39, skipping insertion in model container [2024-10-11 20:34:39,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:34:39" (3/3) ... [2024-10-11 20:34:39,958 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll.c [2024-10-11 20:34:39,971 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:34:39,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-11 20:34:40,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:34:40,024 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;@1ee22d35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:34:40,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-11 20:34:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 107 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:34:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:34:40,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:40,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:34:40,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 180065, now seen corresponding path program 1 times [2024-10-11 20:34:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:40,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895148315] [2024-10-11 20:34:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:40,160 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-11 20:34:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895148315] [2024-10-11 20:34:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895148315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:34:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209326120] [2024-10-11 20:34:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:40,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:34:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:34:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:34:40,187 INFO L87 Difference]: Start difference. First operand has 115 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 107 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:34:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:40,223 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2024-10-11 20:34:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:34:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:34:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:40,232 INFO L225 Difference]: With dead ends: 225 [2024-10-11 20:34:40,232 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 20:34:40,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:34:40,239 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:40,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:34:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 20:34:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 20:34:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 101 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:34:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2024-10-11 20:34:40,273 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 3 [2024-10-11 20:34:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:40,274 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2024-10-11 20:34:40,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:34:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2024-10-11 20:34:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:34:40,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:40,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:34:40,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:34:40,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:40,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 180060, now seen corresponding path program 1 times [2024-10-11 20:34:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655184563] [2024-10-11 20:34:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:40,343 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-11 20:34:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655184563] [2024-10-11 20:34:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655184563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:34:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966006204] [2024-10-11 20:34:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:34:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:34:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:34:40,345 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:34:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:40,479 INFO L93 Difference]: Finished difference Result 203 states and 212 transitions. [2024-10-11 20:34:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:34:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:34:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:40,481 INFO L225 Difference]: With dead ends: 203 [2024-10-11 20:34:40,481 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 20:34:40,483 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-11 20:34:40,484 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 68 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:40,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 158 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 20:34:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2024-10-11 20:34:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.6304347826086956) internal successors, (150), 137 states have internal predecessors, (150), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:34:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2024-10-11 20:34:40,498 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 3 [2024-10-11 20:34:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:40,498 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2024-10-11 20:34:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:34:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2024-10-11 20:34:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:34:40,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:40,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:34:40,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:40,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1323262285, now seen corresponding path program 1 times [2024-10-11 20:34:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447803361] [2024-10-11 20:34:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478744277] [2024-10-11 20:34:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:40,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:34:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:40,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:34:40,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:34:40,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:34:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:40,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447803361] [2024-10-11 20:34:40,633 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:40,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478744277] [2024-10-11 20:34:40,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478744277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:40,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:40,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:34:40,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674170418] [2024-10-11 20:34:40,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:34:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:34:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:34:40,638 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:40,735 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2024-10-11 20:34:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:34:40,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 20:34:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:40,737 INFO L225 Difference]: With dead ends: 175 [2024-10-11 20:34:40,739 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 20:34:40,740 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-11 20:34:40,740 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 20:34:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2024-10-11 20:34:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 102 states have (on average 1.5784313725490196) internal successors, (161), 147 states have internal predecessors, (161), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:34:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 181 transitions. [2024-10-11 20:34:40,751 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 181 transitions. Word has length 24 [2024-10-11 20:34:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:40,752 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 181 transitions. [2024-10-11 20:34:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 181 transitions. [2024-10-11 20:34:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:34:40,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:40,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:40,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:34:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:40,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1928542194, now seen corresponding path program 1 times [2024-10-11 20:34:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508190256] [2024-10-11 20:34:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:34:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508190256] [2024-10-11 20:34:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508190256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:34:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886264347] [2024-10-11 20:34:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:41,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:34:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:34:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:34:41,059 INFO L87 Difference]: Start difference. First operand 159 states and 181 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:41,146 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2024-10-11 20:34:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:34:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 20:34:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:41,147 INFO L225 Difference]: With dead ends: 175 [2024-10-11 20:34:41,149 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:34:41,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 20:34:41,150 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:41,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 158 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:34:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 20:34:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 150 states have internal predecessors, (157), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:34:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2024-10-11 20:34:41,168 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 25 [2024-10-11 20:34:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:41,170 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2024-10-11 20:34:41,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2024-10-11 20:34:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:34:41,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:41,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:34:41,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:41,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -576946569, now seen corresponding path program 1 times [2024-10-11 20:34:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412736946] [2024-10-11 20:34:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:34:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412736946] [2024-10-11 20:34:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412736946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:41,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:34:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041885351] [2024-10-11 20:34:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:41,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:34:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:34:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:34:41,353 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:41,493 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2024-10-11 20:34:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:34:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 20:34:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:41,495 INFO L225 Difference]: With dead ends: 167 [2024-10-11 20:34:41,495 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:34:41,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:34:41,496 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:41,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:34:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-10-11 20:34:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 150 states have internal predecessors, (155), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:34:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2024-10-11 20:34:41,507 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 28 [2024-10-11 20:34:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:41,507 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2024-10-11 20:34:41,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2024-10-11 20:34:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:34:41,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:41,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:41,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:34:41,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1512137157, now seen corresponding path program 1 times [2024-10-11 20:34:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314999390] [2024-10-11 20:34:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:34:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314999390] [2024-10-11 20:34:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314999390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:41,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:41,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:34:41,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022408664] [2024-10-11 20:34:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:41,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:34:41,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:34:41,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:34:41,595 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:41,695 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-10-11 20:34:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:34:41,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 20:34:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:41,696 INFO L225 Difference]: With dead ends: 167 [2024-10-11 20:34:41,696 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 20:34:41,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 20:34:41,699 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:41,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 140 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 20:34:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-11 20:34:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.5476190476190477) internal successors, (130), 129 states have internal predecessors, (130), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:34:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2024-10-11 20:34:41,707 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 32 [2024-10-11 20:34:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:41,707 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2024-10-11 20:34:41,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:34:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2024-10-11 20:34:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:34:41,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:41,708 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:34:41,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:34:41,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:41,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1722693304, now seen corresponding path program 1 times [2024-10-11 20:34:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:41,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519984743] [2024-10-11 20:34:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:41,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519984743] [2024-10-11 20:34:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519984743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:34:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319683047] [2024-10-11 20:34:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:41,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:34:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:34:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:34:41,824 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:41,924 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2024-10-11 20:34:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:34:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-11 20:34:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:41,927 INFO L225 Difference]: With dead ends: 142 [2024-10-11 20:34:41,927 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 20:34:41,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-11 20:34:41,928 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:41,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 20:34:41,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-10-11 20:34:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 130 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:34:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2024-10-11 20:34:41,937 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 45 [2024-10-11 20:34:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:41,937 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2024-10-11 20:34:41,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2024-10-11 20:34:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:34:41,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:41,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:34:41,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:34:41,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:41,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1863884767, now seen corresponding path program 1 times [2024-10-11 20:34:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314013184] [2024-10-11 20:34:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:42,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314013184] [2024-10-11 20:34:42,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314013184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:42,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:42,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:34:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274403509] [2024-10-11 20:34:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:42,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:34:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:34:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:34:42,032 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:42,103 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2024-10-11 20:34:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:34:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-10-11 20:34:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:42,104 INFO L225 Difference]: With dead ends: 142 [2024-10-11 20:34:42,104 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 20:34:42,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:34:42,105 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:42,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 20:34:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-10-11 20:34:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 131 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:34:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2024-10-11 20:34:42,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 46 [2024-10-11 20:34:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:42,114 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2024-10-11 20:34:42,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2024-10-11 20:34:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 20:34:42,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:42,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:42,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:34:42,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:42,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash -191897341, now seen corresponding path program 1 times [2024-10-11 20:34:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818211408] [2024-10-11 20:34:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818211408] [2024-10-11 20:34:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818211408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934895302] [2024-10-11 20:34:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:42,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:42,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:42,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:42,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:34:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:34:42,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:34:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934895302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:34:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 20:34:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674145945] [2024-10-11 20:34:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:34:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:34:42,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:34:42,334 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:42,394 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2024-10-11 20:34:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:34:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-11 20:34:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:42,395 INFO L225 Difference]: With dead ends: 141 [2024-10-11 20:34:42,395 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 20:34:42,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-11 20:34:42,395 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 72 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:42,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 125 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 20:34:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 20:34:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.430232558139535) internal successors, (123), 122 states have internal predecessors, (123), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:34:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2024-10-11 20:34:42,399 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 48 [2024-10-11 20:34:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:42,400 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2024-10-11 20:34:42,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:34:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2024-10-11 20:34:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 20:34:42,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:42,401 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:42,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:34:42,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:42,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:42,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1653850230, now seen corresponding path program 1 times [2024-10-11 20:34:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077022406] [2024-10-11 20:34:42,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:42,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077022406] [2024-10-11 20:34:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077022406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:42,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039379583] [2024-10-11 20:34:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:42,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:42,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:42,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:34:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:42,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:34:42,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:34:42,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039379583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:42,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 20:34:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138267101] [2024-10-11 20:34:42,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:42,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:34:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:34:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:34:42,805 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 20:34:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:42,928 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2024-10-11 20:34:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:34:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 49 [2024-10-11 20:34:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:42,930 INFO L225 Difference]: With dead ends: 227 [2024-10-11 20:34:42,930 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 20:34:42,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 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-11 20:34:42,931 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 131 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:42,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 274 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 20:34:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 123. [2024-10-11 20:34:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 113 states have internal predecessors, (114), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:34:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2024-10-11 20:34:42,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 49 [2024-10-11 20:34:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2024-10-11 20:34:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 20:34:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2024-10-11 20:34:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:34:42,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:42,942 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-11 20:34:42,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:43,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:43,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1121586609, now seen corresponding path program 1 times [2024-10-11 20:34:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284233158] [2024-10-11 20:34:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:43,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651536945] [2024-10-11 20:34:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:43,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:43,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:34:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:43,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:34:43,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:34:43,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:34:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284233158] [2024-10-11 20:34:43,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651536945] [2024-10-11 20:34:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651536945] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:43,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:34:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 20:34:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389547546] [2024-10-11 20:34:43,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:34:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:43,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:34:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:34:43,336 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:34:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:43,479 INFO L93 Difference]: Finished difference Result 302 states and 324 transitions. [2024-10-11 20:34:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:34:43,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2024-10-11 20:34:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:43,480 INFO L225 Difference]: With dead ends: 302 [2024-10-11 20:34:43,480 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 20:34:43,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:34:43,481 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 340 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:43,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 290 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 20:34:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 200. [2024-10-11 20:34:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 157 states have (on average 1.375796178343949) internal successors, (216), 183 states have internal predecessors, (216), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 20:34:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 246 transitions. [2024-10-11 20:34:43,489 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 246 transitions. Word has length 62 [2024-10-11 20:34:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 246 transitions. [2024-10-11 20:34:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:34:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 246 transitions. [2024-10-11 20:34:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:34:43,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:43,490 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:43,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:34:43,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:34:43,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:43,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 83811180, now seen corresponding path program 1 times [2024-10-11 20:34:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221992473] [2024-10-11 20:34:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:43,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597145565] [2024-10-11 20:34:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:43,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:43,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:43,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:43,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:34:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:43,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:34:43,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:43,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221992473] [2024-10-11 20:34:43,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597145565] [2024-10-11 20:34:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597145565] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:43,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:34:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 20:34:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143680020] [2024-10-11 20:34:43,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:34:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:43,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:34:43,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:34:43,894 INFO L87 Difference]: Start difference. First operand 200 states and 246 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:34:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:44,080 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2024-10-11 20:34:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:34:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 69 [2024-10-11 20:34:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:44,081 INFO L225 Difference]: With dead ends: 260 [2024-10-11 20:34:44,081 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 20:34:44,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:34:44,082 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 151 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:44,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 230 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 20:34:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 196. [2024-10-11 20:34:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 178 states have internal predecessors, (201), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 20:34:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2024-10-11 20:34:44,090 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 69 [2024-10-11 20:34:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2024-10-11 20:34:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:34:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2024-10-11 20:34:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 20:34:44,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:44,091 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:44,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:34:44,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:34:44,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1696820647, now seen corresponding path program 1 times [2024-10-11 20:34:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936681361] [2024-10-11 20:34:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:44,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936681361] [2024-10-11 20:34:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936681361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616898412] [2024-10-11 20:34:44,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:44,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:44,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:44,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:44,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:34:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:44,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:34:44,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:44,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616898412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:44,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:34:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436297020] [2024-10-11 20:34:44,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:34:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:44,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:34:44,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:34:44,667 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 20:34:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:44,821 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-10-11 20:34:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:34:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 70 [2024-10-11 20:34:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:44,823 INFO L225 Difference]: With dead ends: 196 [2024-10-11 20:34:44,823 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 20:34:44,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:34:44,824 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 91 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:44,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 174 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 20:34:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-11 20:34:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 159 states have (on average 1.220125786163522) internal successors, (194), 175 states have internal predecessors, (194), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 20:34:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2024-10-11 20:34:44,834 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 70 [2024-10-11 20:34:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:44,834 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2024-10-11 20:34:44,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 20:34:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2024-10-11 20:34:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 20:34:44,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:44,836 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:44,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:34:45,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:34:45,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1061832434, now seen corresponding path program 1 times [2024-10-11 20:34:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108441630] [2024-10-11 20:34:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108441630] [2024-10-11 20:34:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108441630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040924500] [2024-10-11 20:34:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:45,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:45,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:45,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:45,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:34:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:34:45,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:45,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040924500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:45,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:34:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924538085] [2024-10-11 20:34:45,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:34:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:45,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:34:45,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:34:45,328 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 20:34:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:45,506 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2024-10-11 20:34:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:34:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 71 [2024-10-11 20:34:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:45,508 INFO L225 Difference]: With dead ends: 219 [2024-10-11 20:34:45,508 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 20:34:45,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:34:45,508 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 118 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:45,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 20:34:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2024-10-11 20:34:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 159 states have (on average 1.119496855345912) internal successors, (178), 168 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 20:34:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2024-10-11 20:34:45,515 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 71 [2024-10-11 20:34:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:45,516 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2024-10-11 20:34:45,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-11 20:34:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2024-10-11 20:34:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 20:34:45,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:45,516 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:45,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:34:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:45,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:45,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1781249712, now seen corresponding path program 1 times [2024-10-11 20:34:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466674860] [2024-10-11 20:34:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466674860] [2024-10-11 20:34:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466674860] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866350762] [2024-10-11 20:34:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:45,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:34:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:45,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:34:45,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:34:46,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:34:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866350762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:34:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 20:34:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603527543] [2024-10-11 20:34:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:34:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:34:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:34:46,162 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:34:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:46,268 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2024-10-11 20:34:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:34:46,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2024-10-11 20:34:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:46,270 INFO L225 Difference]: With dead ends: 186 [2024-10-11 20:34:46,270 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 20:34:46,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:34:46,270 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:46,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 103 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:34:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 20:34:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-11 20:34:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 140 states have internal predecessors, (142), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:34:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-10-11 20:34:46,278 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 73 [2024-10-11 20:34:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:46,279 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-10-11 20:34:46,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:34:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-10-11 20:34:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 20:34:46,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:46,280 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2024-10-11 20:34:46,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:34:46,485 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1108082881, now seen corresponding path program 1 times [2024-10-11 20:34:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043579364] [2024-10-11 20:34:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 20:34:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:34:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:34:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:34:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:34:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043579364] [2024-10-11 20:34:46,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043579364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989229982] [2024-10-11 20:34:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:46,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:46,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:46,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:46,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:34:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:46,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:34:46,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:34:47,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 20:34:47,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989229982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:47,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-11 20:34:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724010636] [2024-10-11 20:34:47,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:47,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 20:34:47,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 20:34:47,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:34:47,219 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 20 states, 19 states have (on average 14.526315789473685) internal successors, (276), 20 states have internal predecessors, (276), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 20:34:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:47,474 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2024-10-11 20:34:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:34:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.526315789473685) internal successors, (276), 20 states have internal predecessors, (276), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 136 [2024-10-11 20:34:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:47,476 INFO L225 Difference]: With dead ends: 243 [2024-10-11 20:34:47,476 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 20:34:47,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:34:47,477 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:47,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 221 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 20:34:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-10-11 20:34:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 214 states have (on average 1.0514018691588785) internal successors, (225), 217 states have internal predecessors, (225), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 20:34:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 267 transitions. [2024-10-11 20:34:47,485 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 267 transitions. Word has length 136 [2024-10-11 20:34:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:47,485 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 267 transitions. [2024-10-11 20:34:47,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.526315789473685) internal successors, (276), 20 states have internal predecessors, (276), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 20:34:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 267 transitions. [2024-10-11 20:34:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 20:34:47,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:47,486 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-10-11 20:34:47,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:47,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:47,686 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:47,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash -606532498, now seen corresponding path program 2 times [2024-10-11 20:34:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417620909] [2024-10-11 20:34:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:47,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 20:34:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:34:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:34:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:34:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:34:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:34:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:34:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417620909] [2024-10-11 20:34:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417620909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205038402] [2024-10-11 20:34:47,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:34:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:47,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:47,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:47,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:34:47,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:34:47,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:47,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:34:47,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:34:48,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:34:48,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205038402] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:48,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:48,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-10-11 20:34:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565804951] [2024-10-11 20:34:48,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 20:34:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 20:34:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:34:48,412 INFO L87 Difference]: Start difference. First operand 240 states and 267 transitions. Second operand has 22 states, 21 states have (on average 14.571428571428571) internal successors, (306), 22 states have internal predecessors, (306), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 20:34:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:48,697 INFO L93 Difference]: Finished difference Result 262 states and 289 transitions. [2024-10-11 20:34:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:34:48,697 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.571428571428571) internal successors, (306), 22 states have internal predecessors, (306), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 161 [2024-10-11 20:34:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:48,699 INFO L225 Difference]: With dead ends: 262 [2024-10-11 20:34:48,699 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 20:34:48,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:34:48,700 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 77 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:48,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 247 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 20:34:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2024-10-11 20:34:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 229 states have (on average 1.0436681222707425) internal successors, (239), 232 states have internal predecessors, (239), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:34:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 285 transitions. [2024-10-11 20:34:48,708 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 285 transitions. Word has length 161 [2024-10-11 20:34:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:48,708 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 285 transitions. [2024-10-11 20:34:48,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.571428571428571) internal successors, (306), 22 states have internal predecessors, (306), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 20:34:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 285 transitions. [2024-10-11 20:34:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 20:34:48,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:48,710 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 20:34:48,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:34:48,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:34:48,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:48,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1979507958, now seen corresponding path program 2 times [2024-10-11 20:34:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164925015] [2024-10-11 20:34:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813299284] [2024-10-11 20:34:48,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:34:48,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:48,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:48,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:48,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:34:49,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:34:49,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:49,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:34:49,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:34:49,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:34:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164925015] [2024-10-11 20:34:49,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813299284] [2024-10-11 20:34:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813299284] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:49,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:34:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 20:34:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750023651] [2024-10-11 20:34:49,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:34:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:34:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:34:49,425 INFO L87 Difference]: Start difference. First operand 257 states and 285 transitions. Second operand has 12 states, 11 states have (on average 24.272727272727273) internal successors, (267), 12 states have internal predecessors, (267), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 20:34:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:49,730 INFO L93 Difference]: Finished difference Result 362 states and 397 transitions. [2024-10-11 20:34:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:34:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.272727272727273) internal successors, (267), 12 states have internal predecessors, (267), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 197 [2024-10-11 20:34:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:49,735 INFO L225 Difference]: With dead ends: 362 [2024-10-11 20:34:49,735 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 20:34:49,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:34:49,736 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 122 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:49,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 713 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 20:34:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 351. [2024-10-11 20:34:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 315 states have (on average 1.0444444444444445) internal successors, (329), 318 states have internal predecessors, (329), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 20:34:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 391 transitions. [2024-10-11 20:34:49,747 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 391 transitions. Word has length 197 [2024-10-11 20:34:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:49,747 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 391 transitions. [2024-10-11 20:34:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.272727272727273) internal successors, (267), 12 states have internal predecessors, (267), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 20:34:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 391 transitions. [2024-10-11 20:34:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-11 20:34:49,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:49,749 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2024-10-11 20:34:49,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:49,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:34:49,949 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:49,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1706702861, now seen corresponding path program 2 times [2024-10-11 20:34:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655943639] [2024-10-11 20:34:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742189116] [2024-10-11 20:34:49,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:34:49,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:49,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:49,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:34:50,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:34:50,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:50,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:34:50,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 20:34:50,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 20:34:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655943639] [2024-10-11 20:34:50,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742189116] [2024-10-11 20:34:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742189116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:50,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:34:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-11 20:34:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866320620] [2024-10-11 20:34:50,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:34:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:34:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:34:50,512 INFO L87 Difference]: Start difference. First operand 351 states and 391 transitions. Second operand has 12 states, 11 states have (on average 24.636363636363637) internal successors, (271), 12 states have internal predecessors, (271), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 20:34:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:50,831 INFO L93 Difference]: Finished difference Result 357 states and 396 transitions. [2024-10-11 20:34:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:34:50,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 24.636363636363637) internal successors, (271), 12 states have internal predecessors, (271), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 204 [2024-10-11 20:34:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:50,832 INFO L225 Difference]: With dead ends: 357 [2024-10-11 20:34:50,832 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 20:34:50,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:34:50,833 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 98 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:50,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 632 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:34:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 20:34:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2024-10-11 20:34:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 317 states have (on average 1.028391167192429) internal successors, (326), 320 states have internal predecessors, (326), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 20:34:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 390 transitions. [2024-10-11 20:34:50,845 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 390 transitions. Word has length 204 [2024-10-11 20:34:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 390 transitions. [2024-10-11 20:34:50,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 24.636363636363637) internal successors, (271), 12 states have internal predecessors, (271), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 20:34:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 390 transitions. [2024-10-11 20:34:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-10-11 20:34:50,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:50,849 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2024-10-11 20:34:50,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:51,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:51,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:51,050 INFO L85 PathProgramCache]: Analyzing trace with hash 123185665, now seen corresponding path program 2 times [2024-10-11 20:34:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926967848] [2024-10-11 20:34:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 20:34:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:34:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:34:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:34:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:34:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:34:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:34:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:34:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:34:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-11 20:34:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 20:34:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 20:34:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 20:34:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 20:34:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:34:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-10-11 20:34:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 20:34:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926967848] [2024-10-11 20:34:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926967848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:51,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134981726] [2024-10-11 20:34:51,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:34:51,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:51,553 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:51,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:34:51,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:34:51,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:51,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:34:51,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-10-11 20:34:51,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-10-11 20:34:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134981726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:34:52,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:34:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2024-10-11 20:34:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325050464] [2024-10-11 20:34:52,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:34:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:52,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:34:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:34:52,237 INFO L87 Difference]: Start difference. First operand 354 states and 390 transitions. Second operand has 24 states, 23 states have (on average 13.043478260869565) internal successors, (300), 24 states have internal predecessors, (300), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 20:34:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:53,355 INFO L93 Difference]: Finished difference Result 354 states and 390 transitions. [2024-10-11 20:34:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 20:34:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 13.043478260869565) internal successors, (300), 24 states have internal predecessors, (300), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 316 [2024-10-11 20:34:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:53,356 INFO L225 Difference]: With dead ends: 354 [2024-10-11 20:34:53,356 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 20:34:53,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=511, Invalid=2795, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 20:34:53,357 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 452 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:53,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1389 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:34:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 20:34:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-10-11 20:34:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 317 states have (on average 1.0157728706624605) internal successors, (322), 319 states have internal predecessors, (322), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 20:34:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 386 transitions. [2024-10-11 20:34:53,371 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 386 transitions. Word has length 316 [2024-10-11 20:34:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:53,371 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 386 transitions. [2024-10-11 20:34:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 13.043478260869565) internal successors, (300), 24 states have internal predecessors, (300), 11 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-10-11 20:34:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 386 transitions. [2024-10-11 20:34:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-11 20:34:53,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:53,374 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1] [2024-10-11 20:34:53,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:34:53,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:53,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash -14529746, now seen corresponding path program 3 times [2024-10-11 20:34:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329420216] [2024-10-11 20:34:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:34:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:34:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:34:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:34:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:34:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 20:34:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:34:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:34:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:34:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:34:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:34:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:34:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:34:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:34:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-11 20:34:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 20:34:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 20:34:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 20:34:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 20:34:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-10-11 20:34:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2024-10-11 20:34:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2024-10-11 20:34:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-10-11 20:34:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:34:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 20:34:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329420216] [2024-10-11 20:34:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329420216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158014000] [2024-10-11 20:34:54,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:34:54,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:54,054 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:34:54,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:34:54,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:54,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:34:54,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 126 proven. 155 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2024-10-11 20:34:54,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:34:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158014000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:34:54,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:34:54,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 23 [2024-10-11 20:34:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122085833] [2024-10-11 20:34:54,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:34:54,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:34:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:34:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:34:54,996 INFO L87 Difference]: Start difference. First operand 353 states and 386 transitions. Second operand has 24 states, 23 states have (on average 12.391304347826088) internal successors, (285), 24 states have internal predecessors, (285), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 20:34:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:58,007 INFO L93 Difference]: Finished difference Result 355 states and 388 transitions. [2024-10-11 20:34:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 20:34:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 12.391304347826088) internal successors, (285), 24 states have internal predecessors, (285), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) Word has length 341 [2024-10-11 20:34:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:58,009 INFO L225 Difference]: With dead ends: 355 [2024-10-11 20:34:58,009 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 20:34:58,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=964, Invalid=4586, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 20:34:58,011 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 487 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:58,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 886 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 20:34:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 20:34:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-10-11 20:34:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 317 states have (on average 1.0063091482649842) internal successors, (319), 318 states have internal predecessors, (319), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 20:34:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 383 transitions. [2024-10-11 20:34:58,025 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 383 transitions. Word has length 341 [2024-10-11 20:34:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:58,025 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 383 transitions. [2024-10-11 20:34:58,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 12.391304347826088) internal successors, (285), 24 states have internal predecessors, (285), 11 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 11 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-11 20:34:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 383 transitions. [2024-10-11 20:34:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-10-11 20:34:58,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:34:58,027 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2024-10-11 20:34:58,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:58,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 20:34:58,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-11 20:34:58,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:34:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2095822122, now seen corresponding path program 3 times [2024-10-11 20:34:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:34:58,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135796546] [2024-10-11 20:34:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:34:58,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:34:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:34:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214758142] [2024-10-11 20:34:58,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:34:58,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:34:58,294 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:34:58,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 20:34:58,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:34:58,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:34:58,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:34:58,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:34:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3465 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2024-10-11 20:34:58,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:34:58,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:34:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135796546] [2024-10-11 20:34:58,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:34:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214758142] [2024-10-11 20:34:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214758142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:34:58,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:34:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:34:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740876361] [2024-10-11 20:34:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:34:58,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:34:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:34:58,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:34:58,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:34:58,522 INFO L87 Difference]: Start difference. First operand 352 states and 383 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 20:34:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:34:58,969 INFO L93 Difference]: Finished difference Result 352 states and 383 transitions. [2024-10-11 20:34:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:34:58,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 467 [2024-10-11 20:34:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:34:58,971 INFO L225 Difference]: With dead ends: 352 [2024-10-11 20:34:58,971 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:34:58,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:34:58,972 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 122 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:34:58,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 52 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:34:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:34:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:34:58,972 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-11 20:34:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:34:58,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 467 [2024-10-11 20:34:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:34:58,973 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:34:58,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 20:34:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:34:58,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2024-10-11 20:34:58,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2024-10-11 20:34:58,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2024-10-11 20:34:58,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2024-10-11 20:34:58,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2024-10-11 20:34:58,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 20:34:59,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:34:59,183 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:34:59,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:34:59,940 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:34:59,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:34:59 BoogieIcfgContainer [2024-10-11 20:34:59,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:34:59,956 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:34:59,956 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:34:59,956 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:34:59,957 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:34:39" (3/4) ... [2024-10-11 20:34:59,958 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:34:59,960 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:34:59,964 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 20:34:59,965 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:34:59,965 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:34:59,965 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:35:00,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:35:00,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:35:00,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:35:00,051 INFO L158 Benchmark]: Toolchain (without parser) took 20792.00ms. Allocated memory was 136.3MB in the beginning and 400.6MB in the end (delta: 264.2MB). Free memory was 66.8MB in the beginning and 327.2MB in the end (delta: -260.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 136.3MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.53ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 66.6MB in the beginning and 162.5MB in the end (delta: -95.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.74ms. Allocated memory is still 190.8MB. Free memory was 162.5MB in the beginning and 160.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: Boogie Preprocessor took 43.75ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: RCFGBuilder took 364.41ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 138.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: TraceAbstraction took 20003.16ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 138.4MB in the beginning and 332.4MB in the end (delta: -194.0MB). Peak memory consumption was 216.0MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,052 INFO L158 Benchmark]: Witness Printer took 94.84ms. Allocated memory is still 400.6MB. Free memory was 332.4MB in the beginning and 327.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:35:00,053 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.85ms. Allocated memory is still 136.3MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.53ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 66.6MB in the beginning and 162.5MB in the end (delta: -95.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.74ms. Allocated memory is still 190.8MB. Free memory was 162.5MB in the beginning and 160.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.75ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 158.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.41ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 138.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20003.16ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 138.4MB in the beginning and 332.4MB in the end (delta: -194.0MB). Peak memory consumption was 216.0MB. Max. memory is 16.1GB. * Witness Printer took 94.84ms. Allocated memory is still 400.6MB. Free memory was 332.4MB in the beginning and 327.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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, 115 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 22, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2654 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2594 mSDsluCounter, 6802 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5137 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7829 IncrementalHoareTripleChecker+Invalid, 8195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 1665 mSDtfsCounter, 7829 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4004 GetRequests, 3728 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=19, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 345 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 4758 NumberOfCodeBlocks, 4061 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 5029 ConstructedInterpolants, 4 QuantifiedInterpolants, 21214 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2621 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 41 InterpolantComputations, 11 PerfectInterpolantSequences, 12957/16663 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 50 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((n <= 2147483647) && (t == 1)) && (a == 0)) && (s == 1)) || ((((((((n <= 2147483647) && (((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0)) && (((__int128) t + 1) <= s)) && (s <= 2863311528)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (s <= ((__int128) 2147483647 + t)))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:35:00,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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