./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/dijkstra.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/nla-digbench/dijkstra.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 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:14:40,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:14:40,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:14:40,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:14:40,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:14:40,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:14:40,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:14:40,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:14:40,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:14:40,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:14:40,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:14:40,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:14:40,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:14:40,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:14:40,723 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:14:40,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:14:40,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:14:40,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:14:40,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:14:40,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:14:40,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:14:40,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:14:40,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:14:40,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:14:40,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:14:40,729 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:14:40,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:14:40,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:14:40,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:14:40,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:14:40,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:14:40,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:14:40,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:14:40,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:14:40,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:14:40,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:14:40,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:14:40,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:14:40,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:14:40,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:14:40,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:14:40,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:14:40,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:14:40,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:14:40,735 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 -> 8c2c25cf461f08df93633b3a41b472f1ef6c33d9d6e519054ad0fbe6ddfed0fc [2024-11-17 04:14:41,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:14:41,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:14:41,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:14:41,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:14:41,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:14:41,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/dijkstra.c [2024-11-17 04:14:42,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:14:42,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:14:42,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/dijkstra.c [2024-11-17 04:14:42,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3e347c7/1ab33c067ec142739978b5f93ec2ff33/FLAGe059e8b29 [2024-11-17 04:14:42,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e3e347c7/1ab33c067ec142739978b5f93ec2ff33 [2024-11-17 04:14:42,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:14:42,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:14:42,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:14:42,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:14:42,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:14:42,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:14:42" (1/1) ... [2024-11-17 04:14:42,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f9a727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:42, skipping insertion in model container [2024-11-17 04:14:42,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:14:42" (1/1) ... [2024-11-17 04:14:42,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:14:43,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:14:43,075 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:14:43,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:14:43,137 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:14:43,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43 WrapperNode [2024-11-17 04:14:43,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:14:43,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:14:43,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:14:43,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:14:43,151 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:14:43" (1/1) ... [2024-11-17 04:14:43,171 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:14:43" (1/1) ... [2024-11-17 04:14:43,214 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 314 [2024-11-17 04:14:43,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:14:43,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:14:43,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:14:43,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:14:43,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,253 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:14:43,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:14:43,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:14:43,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:14:43,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:14:43,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (1/1) ... [2024-11-17 04:14:43,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:14:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:14:43,305 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:14:43,307 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:14:43,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:14:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:14:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:14:43,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:14:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 04:14:43,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 04:14:43,415 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:14:43,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:14:50,384 INFO L? ?]: Removed 585 outVars from TransFormulas that were not future-live. [2024-11-17 04:14:50,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:14:50,422 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:14:50,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:14:50,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:14:50 BoogieIcfgContainer [2024-11-17 04:14:50,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:14:50,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:14:50,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:14:50,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:14:50,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:14:42" (1/3) ... [2024-11-17 04:14:50,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e898ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:14:50, skipping insertion in model container [2024-11-17 04:14:50,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:14:43" (2/3) ... [2024-11-17 04:14:50,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e898ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:14:50, skipping insertion in model container [2024-11-17 04:14:50,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:14:50" (3/3) ... [2024-11-17 04:14:50,435 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra.c [2024-11-17 04:14:50,457 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:14:50,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 258 error locations. [2024-11-17 04:14:50,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:14:50,551 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;@546cf82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:14:50,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 258 error locations. [2024-11-17 04:14:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 281 states have (on average 1.9466192170818506) internal successors, (547), 539 states have internal predecessors, (547), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 04:14:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 04:14:50,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:14:50,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 04:14:50,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-17 04:14:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:14:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 552510076, now seen corresponding path program 1 times [2024-11-17 04:14:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:14:50,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844427255] [2024-11-17 04:14:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:14:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:14:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:14:50,723 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:14:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:14:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844427255] [2024-11-17 04:14:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844427255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:14:50,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:14:50,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:14:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519493171] [2024-11-17 04:14:50,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:14:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 04:14:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:14:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 04:14:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 04:14:50,756 INFO L87 Difference]: Start difference. First operand has 550 states, 281 states have (on average 1.9466192170818506) internal successors, (547), 539 states have internal predecessors, (547), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:14:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:14:50,834 INFO L93 Difference]: Finished difference Result 1077 states and 1125 transitions. [2024-11-17 04:14:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 04:14:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:14:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:14:50,859 INFO L225 Difference]: With dead ends: 1077 [2024-11-17 04:14:50,859 INFO L226 Difference]: Without dead ends: 531 [2024-11-17 04:14:50,867 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:14:50,870 INFO L432 NwaCegarLoop]: 547 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, 547 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:14:50,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:14:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-17 04:14:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-11-17 04:14:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 276 states have (on average 1.8985507246376812) internal successors, (524), 521 states have internal predecessors, (524), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 04:14:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 540 transitions. [2024-11-17 04:14:50,937 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 540 transitions. Word has length 5 [2024-11-17 04:14:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:14:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 540 transitions. [2024-11-17 04:14:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:14:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 540 transitions. [2024-11-17 04:14:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 04:14:50,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:14:50,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 04:14:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:14:50,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr257ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-17 04:14:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:14:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -52065091, now seen corresponding path program 1 times [2024-11-17 04:14:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:14:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110875165] [2024-11-17 04:14:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:14:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:14:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:14:50,995 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:14:50,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:14:50,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110875165] [2024-11-17 04:14:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110875165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:14:50,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:14:50,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:14:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685206555] [2024-11-17 04:14:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:14:50,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:14:50,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:14:50,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:14:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:14:50,999 INFO L87 Difference]: Start difference. First operand 531 states and 540 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:14:55,194 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:14:59,290 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:15:00,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:15:02,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:15:04,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:15:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:15:04,612 INFO L93 Difference]: Finished difference Result 1305 states and 1437 transitions. [2024-11-17 04:15:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:15:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-17 04:15:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:15:04,618 INFO L225 Difference]: With dead ends: 1305 [2024-11-17 04:15:04,618 INFO L226 Difference]: Without dead ends: 782 [2024-11-17 04:15:04,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:15:04,621 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 241 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-17 04:15:04,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 624 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 453 Invalid, 2 Unknown, 0 Unchecked, 13.6s Time] [2024-11-17 04:15:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-17 04:15:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 721. [2024-11-17 04:15:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 460 states have (on average 1.8934782608695653) internal successors, (871), 705 states have internal predecessors, (871), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-17 04:15:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 899 transitions. [2024-11-17 04:15:04,665 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 899 transitions. Word has length 6 [2024-11-17 04:15:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:15:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 899 transitions. [2024-11-17 04:15:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:15:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 899 transitions. [2024-11-17 04:15:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 04:15:04,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:15:04,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:15:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:15:04,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr255ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-17 04:15:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:15:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1505036630, now seen corresponding path program 1 times [2024-11-17 04:15:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:15:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667494923] [2024-11-17 04:15:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:15:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:15:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:15:04,728 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:15:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:15:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667494923] [2024-11-17 04:15:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667494923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:15:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:15:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:15:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232778225] [2024-11-17 04:15:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:15:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:15:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:15:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:15:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:15:04,730 INFO L87 Difference]: Start difference. First operand 721 states and 899 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:15:09,518 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:15:13,538 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:15:17,614 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:15:22,276 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:15:26,287 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:15:30,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:15:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:15:31,099 INFO L93 Difference]: Finished difference Result 1161 states and 1420 transitions. [2024-11-17 04:15:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:15:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 04:15:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:15:31,104 INFO L225 Difference]: With dead ends: 1161 [2024-11-17 04:15:31,105 INFO L226 Difference]: Without dead ends: 1100 [2024-11-17 04:15:31,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:15:31,106 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 374 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 61 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2024-11-17 04:15:31,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 590 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 479 Invalid, 5 Unknown, 0 Unchecked, 26.3s Time] [2024-11-17 04:15:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-17 04:15:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 984. [2024-11-17 04:15:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 715 states have (on average 1.7636363636363637) internal successors, (1261), 960 states have internal predecessors, (1261), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-17 04:15:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1305 transitions. [2024-11-17 04:15:31,172 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1305 transitions. Word has length 8 [2024-11-17 04:15:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:15:31,173 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1305 transitions. [2024-11-17 04:15:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:15:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1305 transitions. [2024-11-17 04:15:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 04:15:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:15:31,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:15:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:15:31,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr253ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-17 04:15:31,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:15:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1063761356, now seen corresponding path program 1 times [2024-11-17 04:15:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:15:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044288124] [2024-11-17 04:15:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:15:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:15:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:15:31,275 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:15:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:15:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044288124] [2024-11-17 04:15:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044288124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:15:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:15:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:15:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584331443] [2024-11-17 04:15:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:15:31,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:15:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:15:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:15:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:15:31,278 INFO L87 Difference]: Start difference. First operand 984 states and 1305 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:15:36,425 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:15:40,439 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:15:45,142 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:15:49,166 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:15:51,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-17 04:15:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:15:51,840 INFO L93 Difference]: Finished difference Result 1023 states and 1306 transitions. [2024-11-17 04:15:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:15:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 04:15:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:15:51,844 INFO L225 Difference]: With dead ends: 1023 [2024-11-17 04:15:51,845 INFO L226 Difference]: Without dead ends: 1021 [2024-11-17 04:15:51,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:15:51,846 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 213 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-17 04:15:51,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 482 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 595 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2024-11-17 04:15:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-17 04:15:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 984. [2024-11-17 04:15:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 715 states have (on average 1.760839160839161) internal successors, (1259), 960 states have internal predecessors, (1259), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-17 04:15:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1303 transitions. [2024-11-17 04:15:51,870 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1303 transitions. Word has length 10 [2024-11-17 04:15:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:15:51,870 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1303 transitions. [2024-11-17 04:15:51,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:15:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1303 transitions. [2024-11-17 04:15:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:15:51,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:15:51,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 04:15:51,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:15:51,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr257ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 255 more)] === [2024-11-17 04:15:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:15:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1933512664, now seen corresponding path program 1 times [2024-11-17 04:15:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:15:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49935281] [2024-11-17 04:15:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:15:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:15:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:15:51,944 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:15:51,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:15:51,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49935281] [2024-11-17 04:15:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49935281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:15:51,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426456959] [2024-11-17 04:15:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:15:51,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:15:51,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:15:51,947 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:15:51,948 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:15:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:15:51,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 04:15:51,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:15:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:15:52,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:15:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426456959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:15:52,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:15:52,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-17 04:15:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248507224] [2024-11-17 04:15:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:15:52,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:15:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:15:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:15:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 04:15:52,071 INFO L87 Difference]: Start difference. First operand 984 states and 1303 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:15:56,517 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:16:00,532 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:16:04,595 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:16:09,210 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:16:13,226 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:16:17,242 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:16:21,285 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:16:25,349 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 []