./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/LexIndexValue-Array-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:12:51,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:12:51,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:12:51,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:12:51,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:12:51,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:12:51,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:12:51,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:12:51,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:12:51,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:12:51,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:12:51,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:12:51,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:12:51,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:12:51,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:12:51,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:12:51,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:12:51,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:12:51,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:12:51,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:12:51,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:12:51,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:12:51,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:12:51,259 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:12:51,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:12:51,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:12:51,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:12:51,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:12:51,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:12:51,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:12:51,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:12:51,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:12:51,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:12:51,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:12:51,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:12:51,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:12:51,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:12:51,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:12:51,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:12:51,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:12:51,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:12:51,267 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff [2024-10-11 20:12:51,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:12:51,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:12:51,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:12:51,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:12:51,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:12:51,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2024-10-11 20:12:53,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:12:53,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:12:53,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2024-10-11 20:12:53,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bebcd2fd/c907de8acee04ad3b286dd6197599564/FLAG6b9f6714e [2024-10-11 20:12:53,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bebcd2fd/c907de8acee04ad3b286dd6197599564 [2024-10-11 20:12:53,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:12:53,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:12:53,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:12:53,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:12:53,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:12:53,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a73e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53, skipping insertion in model container [2024-10-11 20:12:53,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:12:53,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:12:53,410 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:12:53,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:12:53,442 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:12:53,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53 WrapperNode [2024-10-11 20:12:53,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:12:53,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:12:53,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:12:53,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:12:53,450 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:12:53" (1/1) ... [2024-10-11 20:12:53,458 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:12:53" (1/1) ... [2024-10-11 20:12:53,474 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-11 20:12:53,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:12:53,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:12:53,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:12:53,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:12:53,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,498 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-11 20:12:53,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:12:53,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:12:53,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:12:53,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:12:53,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (1/1) ... [2024-10-11 20:12:53,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:12:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:53,543 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:12:53,545 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:12:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:12:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:12:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:12:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:12:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:12:53,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:12:53,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:12:53,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:12:53,770 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 20:12:53,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:12:53,799 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:12:53,799 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:12:53,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:53 BoogieIcfgContainer [2024-10-11 20:12:53,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:12:53,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:12:53,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:12:53,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:12:53,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:12:53" (1/3) ... [2024-10-11 20:12:53,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d62a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:53, skipping insertion in model container [2024-10-11 20:12:53,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:12:53" (2/3) ... [2024-10-11 20:12:53,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d62a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:12:53, skipping insertion in model container [2024-10-11 20:12:53,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:12:53" (3/3) ... [2024-10-11 20:12:53,813 INFO L112 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2024-10-11 20:12:53,829 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:12:53,830 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:12:53,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:12:53,899 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;@69e063e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:12:53,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:12:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 20 states have internal predecessors, (26), 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:12:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:12:53,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:53,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:12:53,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 88394, now seen corresponding path program 1 times [2024-10-11 20:12:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504027100] [2024-10-11 20:12:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:54,193 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:12:54,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504027100] [2024-10-11 20:12:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504027100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:54,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19172649] [2024-10-11 20:12:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:54,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:12:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:12:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:12:54,227 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:54,276 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-10-11 20:12:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:12:54,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:12:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:54,285 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:12:54,285 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 20:12:54,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:12:54,290 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:54,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 20:12:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-11 20:12:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 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:12:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-11 20:12:54,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 3 [2024-10-11 20:12:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-11 20:12:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-11 20:12:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:12:54,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:54,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:12:54,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:12:54,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2740260, now seen corresponding path program 1 times [2024-10-11 20:12:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775261444] [2024-10-11 20:12:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:54,396 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:12:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775261444] [2024-10-11 20:12:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775261444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755184416] [2024-10-11 20:12:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:54,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:12:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:54,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:12:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:12:54,401 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:54,428 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-11 20:12:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:12:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:12:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:54,432 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:12:54,433 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:12:54,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:12:54,435 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:54,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:12:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 20:12:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 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:12:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-11 20:12:54,446 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2024-10-11 20:12:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:54,447 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-11 20:12:54,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-11 20:12:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:12:54,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:54,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-11 20:12:54,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:12:54,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 30795897, now seen corresponding path program 1 times [2024-10-11 20:12:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651942565] [2024-10-11 20:12:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:12:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:54,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651942565] [2024-10-11 20:12:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651942565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:54,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635245619] [2024-10-11 20:12:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:54,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:12:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:54,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:12:54,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:54,542 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:54,561 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-10-11 20:12:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:12:54,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:12:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:54,562 INFO L225 Difference]: With dead ends: 21 [2024-10-11 20:12:54,562 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 20:12:54,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:12:54,563 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:54,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 20:12:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-11 20:12:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 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:12:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-11 20:12:54,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 7 [2024-10-11 20:12:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-11 20:12:54,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-10-11 20:12:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:12:54,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:54,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:12:54,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash -227015503, now seen corresponding path program 1 times [2024-10-11 20:12:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195293311] [2024-10-11 20:12:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:12:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195293311] [2024-10-11 20:12:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195293311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:12:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101068379] [2024-10-11 20:12:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:12:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:12:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:12:54,663 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:12:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:54,698 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-11 20:12:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:12:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-11 20:12:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:54,700 INFO L225 Difference]: With dead ends: 30 [2024-10-11 20:12:54,700 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:12:54,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:12:54,703 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:54,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:12:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 20:12:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 25 states have internal predecessors, (33), 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:12:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 20:12:54,711 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2024-10-11 20:12:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:54,712 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 20:12:54,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:12:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 20:12:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:12:54,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:54,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:12:54,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -227015311, now seen corresponding path program 1 times [2024-10-11 20:12:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752330436] [2024-10-11 20:12:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:12:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752330436] [2024-10-11 20:12:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752330436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:12:54,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:12:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:12:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517744580] [2024-10-11 20:12:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:12:54,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:12:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:12:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:12:54,901 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:12:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:54,955 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-10-11 20:12:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:12:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-10-11 20:12:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:54,956 INFO L225 Difference]: With dead ends: 26 [2024-10-11 20:12:54,956 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 20:12:54,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:12:54,958 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:54,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 20:12:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 20:12:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-11 20:12:54,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 11 [2024-10-11 20:12:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-11 20:12:54,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:12:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-10-11 20:12:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:12:54,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:54,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:54,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:12:54,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1552460030, now seen corresponding path program 1 times [2024-10-11 20:12:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065691944] [2024-10-11 20:12:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:54,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065691944] [2024-10-11 20:12:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065691944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896275609] [2024-10-11 20:12:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:55,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:55,040 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:12:55,042 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:12:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:55,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:12:55,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:12:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896275609] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:12:55,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:12:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-11 20:12:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470633491] [2024-10-11 20:12:55,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:12:55,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:12:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:12:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:12:55,189 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:55,228 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-10-11 20:12:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:12:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:12:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:55,232 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:12:55,233 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:12:55,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:12:55,235 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:55,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:12:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:12:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 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:12:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-11 20:12:55,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2024-10-11 20:12:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:55,245 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-11 20:12:55,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-11 20:12:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:12:55,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:55,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:55,263 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:12:55,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:55,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1202089182, now seen corresponding path program 2 times [2024-10-11 20:12:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629779225] [2024-10-11 20:12:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629779225] [2024-10-11 20:12:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629779225] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302685367] [2024-10-11 20:12:55,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:12:55,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:55,572 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:12:55,573 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:12:55,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:12:55,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:12:55,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:12:55,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:12:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:55,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302685367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:12:55,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:12:55,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 20:12:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302904470] [2024-10-11 20:12:55,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:12:55,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:12:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:12:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:12:55,764 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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:12:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:55,812 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-11 20:12:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:12:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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 18 [2024-10-11 20:12:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:55,814 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:12:55,814 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:12:55,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:12:55,815 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:55,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:12:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:12:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:12:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 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:12:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-11 20:12:55,822 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2024-10-11 20:12:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:55,822 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-11 20:12:55,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 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:12:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-11 20:12:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:12:55,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:55,825 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:55,842 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:12:56,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:56,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -103760738, now seen corresponding path program 3 times [2024-10-11 20:12:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871218491] [2024-10-11 20:12:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871218491] [2024-10-11 20:12:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871218491] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285016061] [2024-10-11 20:12:56,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:12:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:56,321 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:12:56,323 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:12:56,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-11 20:12:56,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:12:56,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:12:56,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:56,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:12:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285016061] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:12:56,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:12:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2024-10-11 20:12:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778475566] [2024-10-11 20:12:56,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:12:56,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 20:12:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:56,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 20:12:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:12:56,816 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 31 states have internal predecessors, (53), 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:12:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:56,912 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2024-10-11 20:12:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:12:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 31 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 20:12:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:56,913 INFO L225 Difference]: With dead ends: 87 [2024-10-11 20:12:56,914 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 20:12:56,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:12:56,915 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:56,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:12:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 20:12:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 20:12:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.140625) internal successors, (73), 66 states have internal predecessors, (73), 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:12:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-10-11 20:12:56,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2024-10-11 20:12:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:56,927 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-10-11 20:12:56,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 31 states have internal predecessors, (53), 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:12:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-10-11 20:12:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 20:12:56,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:56,929 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:56,945 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:12:57,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:57,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:57,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1852341278, now seen corresponding path program 4 times [2024-10-11 20:12:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689708000] [2024-10-11 20:12:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:12:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:57,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:12:57,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689708000] [2024-10-11 20:12:57,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689708000] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:12:57,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093717294] [2024-10-11 20:12:57,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:12:57,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:12:57,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:12:57,940 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:12:57,941 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:12:58,026 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:12:58,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:12:58,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 20:12:58,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:12:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:58,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:12:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:12:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093717294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:12:59,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:12:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2024-10-11 20:12:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576827871] [2024-10-11 20:12:59,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:12:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-11 20:12:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:12:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-11 20:12:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:12:59,136 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 64 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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:12:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:12:59,287 INFO L93 Difference]: Finished difference Result 135 states and 162 transitions. [2024-10-11 20:12:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-11 20:12:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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 54 [2024-10-11 20:12:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:12:59,289 INFO L225 Difference]: With dead ends: 135 [2024-10-11 20:12:59,289 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 20:12:59,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 20:12:59,292 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:12:59,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:12:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 20:12:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 20:12:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 114 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:12:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2024-10-11 20:12:59,315 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 54 [2024-10-11 20:12:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:12:59,316 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2024-10-11 20:12:59,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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:12:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2024-10-11 20:12:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 20:12:59,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:12:59,318 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:12:59,338 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:12:59,521 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,SelfDestructingSolverStorable8 [2024-10-11 20:12:59,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:12:59,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:12:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 686062366, now seen corresponding path program 5 times [2024-10-11 20:12:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:12:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828852804] [2024-10-11 20:12:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:12:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:12:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828852804] [2024-10-11 20:13:01,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828852804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:01,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040210169] [2024-10-11 20:13:01,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 20:13:01,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:01,927 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:13:01,929 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:13:02,883 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-10-11 20:13:02,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:13:02,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 20:13:02,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:13:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:03,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:13:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040210169] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:13:06,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:13:06,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2024-10-11 20:13:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855431583] [2024-10-11 20:13:06,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:13:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-10-11 20:13:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-10-11 20:13:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4160, Invalid=12096, Unknown=0, NotChecked=0, Total=16256 [2024-10-11 20:13:06,305 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 128 states, 128 states have (on average 1.5390625) internal successors, (197), 127 states have internal predecessors, (197), 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:13:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:06,649 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2024-10-11 20:13:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-10-11 20:13:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.5390625) internal successors, (197), 127 states have internal predecessors, (197), 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 102 [2024-10-11 20:13:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:06,651 INFO L225 Difference]: With dead ends: 231 [2024-10-11 20:13:06,651 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 20:13:06,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4160, Invalid=12096, Unknown=0, NotChecked=0, Total=16256 [2024-10-11 20:13:06,656 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:06,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:13:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 20:13:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-11 20:13:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 208 states have (on average 1.0432692307692308) internal successors, (217), 210 states have internal predecessors, (217), 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:13:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 217 transitions. [2024-10-11 20:13:06,682 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 217 transitions. Word has length 102 [2024-10-11 20:13:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:06,683 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 217 transitions. [2024-10-11 20:13:06,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 1.5390625) internal successors, (197), 127 states have internal predecessors, (197), 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:13:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 217 transitions. [2024-10-11 20:13:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 20:13:06,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:06,686 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:06,706 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:13:06,886 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,SelfDestructingSolverStorable9 [2024-10-11 20:13:06,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:13:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash 621705502, now seen corresponding path program 6 times [2024-10-11 20:13:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173774080] [2024-10-11 20:13:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173774080] [2024-10-11 20:13:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173774080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318464062] [2024-10-11 20:13:13,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 20:13:13,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:13,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:13,884 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:13:13,886 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