./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_natnum.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sum_natnum.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff2ea40d6d25fb86e36a6b6b626bedee46fbbe211877b096a26da0b150125568 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:11:59,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:11:59,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:11:59,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:11:59,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:11:59,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:11:59,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:11:59,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:11:59,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:11:59,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:11:59,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:11:59,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:11:59,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:11:59,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:11:59,626 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:11:59,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:11:59,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:11:59,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:11:59,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:11:59,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:11:59,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:11:59,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:11:59,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:11:59,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:11:59,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:11:59,631 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:11:59,631 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:11:59,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:11:59,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:11:59,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:11:59,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:11:59,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:11:59,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:11:59,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:11:59,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff2ea40d6d25fb86e36a6b6b626bedee46fbbe211877b096a26da0b150125568 [2024-11-17 04:11:59,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:11:59,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:11:59,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:11:59,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:11:59,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:11:59,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sum_natnum.c [2024-11-17 04:12:01,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:12:01,286 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:12:01,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sum_natnum.c [2024-11-17 04:12:01,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925ba2a9a/bfd2c5ce33a1433d9bc0475867ce7732/FLAG8ff740e6d [2024-11-17 04:12:01,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925ba2a9a/bfd2c5ce33a1433d9bc0475867ce7732 [2024-11-17 04:12:01,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:12:01,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:12:01,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:12:01,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:12:01,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:12:01,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b482801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01, skipping insertion in model container [2024-11-17 04:12:01,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:12:01,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:12:01,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:12:01,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:12:01,522 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:12:01,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01 WrapperNode [2024-11-17 04:12:01,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:12:01,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:12:01,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:12:01,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:12:01,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,544 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2024-11-17 04:12:01,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:12:01,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:12:01,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:12:01,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:12:01,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 04:12:01,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:12:01,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:12:01,580 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:12:01,580 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:12:01,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (1/1) ... [2024-11-17 04:12:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:12:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:01,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 04:12:01,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 04:12:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:12:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:12:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:12:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:12:01,704 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:12:01,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:12:17,860 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-17 04:12:17,860 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:12:17,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:12:17,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:12:17,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:12:17 BoogieIcfgContainer [2024-11-17 04:12:17,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:12:17,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:12:17,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:12:17,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:12:17,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:12:01" (1/3) ... [2024-11-17 04:12:17,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941e8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:12:17, skipping insertion in model container [2024-11-17 04:12:17,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:12:01" (2/3) ... [2024-11-17 04:12:17,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941e8c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:12:17, skipping insertion in model container [2024-11-17 04:12:17,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:12:17" (3/3) ... [2024-11-17 04:12:17,874 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_natnum.c [2024-11-17 04:12:17,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:12:17,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-17 04:12:17,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:12:17,933 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;@4c7c7160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:12:17,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 04:12:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.55) internal successors, (31), 28 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-11-17 04:12:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 04:12:17,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:17,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 04:12:17,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:17,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1876791, now seen corresponding path program 1 times [2024-11-17 04:12:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:17,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341448383] [2024-11-17 04:12:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341448383] [2024-11-17 04:12:18,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341448383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:18,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:12:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:12:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480831717] [2024-11-17 04:12:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 04:12:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 04:12:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:12:18,080 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.55) internal successors, (31), 28 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:18,090 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-11-17 04:12:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 04:12:18,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 04:12:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:18,100 INFO L225 Difference]: With dead ends: 46 [2024-11-17 04:12:18,101 INFO L226 Difference]: Without dead ends: 19 [2024-11-17 04:12:18,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:12:18,107 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:18,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-17 04:12:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-17 04:12:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-17 04:12:18,134 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 4 [2024-11-17 04:12:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:18,135 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-17 04:12:18,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-17 04:12:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 04:12:18,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:18,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 04:12:18,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:12:18,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:18,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash 58179766, now seen corresponding path program 1 times [2024-11-17 04:12:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777003724] [2024-11-17 04:12:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777003724] [2024-11-17 04:12:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777003724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:18,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:12:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:12:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860002053] [2024-11-17 04:12:18,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:18,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:12:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:12:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:12:18,224 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:22,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:26,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:30,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:34,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:34,287 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-17 04:12:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:12:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-17 04:12:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:34,290 INFO L225 Difference]: With dead ends: 35 [2024-11-17 04:12:34,290 INFO L226 Difference]: Without dead ends: 23 [2024-11-17 04:12:34,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:12:34,291 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:34,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-17 04:12:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-17 04:12:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-17 04:12:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-17 04:12:34,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 5 [2024-11-17 04:12:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-17 04:12:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-17 04:12:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 04:12:34,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:34,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 04:12:34,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:12:34,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:34,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1528046558, now seen corresponding path program 1 times [2024-11-17 04:12:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878825595] [2024-11-17 04:12:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:34,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878825595] [2024-11-17 04:12:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878825595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838088342] [2024-11-17 04:12:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:34,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:34,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:34,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:12:34,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 04:12:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:34,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:12:34,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:34,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:12:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838088342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:12:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 04:12:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157743512] [2024-11-17 04:12:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:34,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:12:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:12:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:12:34,449 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:34,473 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-17 04:12:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:12:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 04:12:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:34,474 INFO L225 Difference]: With dead ends: 23 [2024-11-17 04:12:34,474 INFO L226 Difference]: Without dead ends: 22 [2024-11-17 04:12:34,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:12:34,475 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:34,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-17 04:12:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-17 04:12:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 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-11-17 04:12:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-17 04:12:34,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 10 [2024-11-17 04:12:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:34,479 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-17 04:12:34,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-17 04:12:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 04:12:34,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:34,479 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:12:34,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 04:12:34,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:34,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:34,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash -124804171, now seen corresponding path program 1 times [2024-11-17 04:12:34,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022566551] [2024-11-17 04:12:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 04:12:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022566551] [2024-11-17 04:12:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022566551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:12:34,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:12:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 04:12:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211705587] [2024-11-17 04:12:34,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:12:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:12:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:34,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:12:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:12:34,739 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:38,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:42,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:42,773 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-17 04:12:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:12:42,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 04:12:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:42,781 INFO L225 Difference]: With dead ends: 21 [2024-11-17 04:12:42,781 INFO L226 Difference]: Without dead ends: 20 [2024-11-17 04:12:42,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:12:42,782 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:42,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2024-11-17 04:12:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-17 04:12:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 04:12:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-17 04:12:42,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2024-11-17 04:12:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:42,786 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-17 04:12:42,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-17 04:12:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 04:12:42,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:42,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-17 04:12:42,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:12:42,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:42,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash -124803050, now seen corresponding path program 1 times [2024-11-17 04:12:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24896095] [2024-11-17 04:12:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24896095] [2024-11-17 04:12:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24896095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234177450] [2024-11-17 04:12:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:42,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:42,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:12:42,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 04:12:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:42,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:12:42,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:42,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234177450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:42,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:42,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-17 04:12:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050083699] [2024-11-17 04:12:42,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:42,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:12:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:42,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:12:42,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:12:42,935 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:12:42,977 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-17 04:12:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:12:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-11-17 04:12:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:12:42,982 INFO L225 Difference]: With dead ends: 36 [2024-11-17 04:12:42,982 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:12:42,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:12:42,983 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:12:42,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:12:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:12:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:12:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-17 04:12:42,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 11 [2024-11-17 04:12:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:12:42,987 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-17 04:12:42,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-17 04:12:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 04:12:42,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:12:42,988 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:12:43,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 04:12:43,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:43,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:12:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:12:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash 322275475, now seen corresponding path program 1 times [2024-11-17 04:12:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:12:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416890781] [2024-11-17 04:12:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:12:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:12:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416890781] [2024-11-17 04:12:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416890781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:12:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323908885] [2024-11-17 04:12:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:12:43,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:12:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:12:43,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:12:43,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 04:12:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:12:43,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 04:12:43,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:12:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:43,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:12:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:12:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323908885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:12:43,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:12:43,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-17 04:12:43,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932612437] [2024-11-17 04:12:43,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:12:43,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 04:12:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:12:43,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 04:12:43,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:12:43,411 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:12:47,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:51,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:55,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:12:59,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:03,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:07,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:11,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:15,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:19,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:23,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:27,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:31,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:35,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:39,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:13:39,563 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-17 04:13:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:13:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 04:13:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:13:39,568 INFO L225 Difference]: With dead ends: 43 [2024-11-17 04:13:39,569 INFO L226 Difference]: Without dead ends: 35 [2024-11-17 04:13:39,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-17 04:13:39,569 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:13:39,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 8 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 56.1s Time] [2024-11-17 04:13:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-17 04:13:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-17 04:13:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:13:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-17 04:13:39,573 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 13 [2024-11-17 04:13:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:13:39,573 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-17 04:13:39,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:13:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-17 04:13:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 04:13:39,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:13:39,574 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2024-11-17 04:13:39,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 04:13:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:13:39,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-17 04:13:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:13:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1142702174, now seen corresponding path program 2 times [2024-11-17 04:13:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:13:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183002954] [2024-11-17 04:13:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:13:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:13:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:13:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 04:13:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:13:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183002954] [2024-11-17 04:13:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183002954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:13:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071398530] [2024-11-17 04:13:39,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:13:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:13:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:13:39,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 04:13:39,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 04:13:39,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 04:13:39,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:13:39,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:13:39,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:13:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 04:13:39,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:13:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 04:13:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071398530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:13:39,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:13:39,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-11-17 04:13:39,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011660306] [2024-11-17 04:13:39,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:13:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:13:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:13:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:13:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:13:39,948 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:13:43,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:47,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:13:51,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []