./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:31:15,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:31:15,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:31:15,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:31:15,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:31:15,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:31:15,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:31:15,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:31:15,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:31:15,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:31:15,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:31:15,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:31:15,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:31:15,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:31:15,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:31:15,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:31:15,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:31:15,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:31:15,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:31:15,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:31:15,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:31:15,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:31:15,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:31:15,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:31:15,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:31:15,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:31:15,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:31:15,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:31:15,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:31:15,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:31:15,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:31:15,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:31:15,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:15,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:31:15,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:31:15,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:31:15,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:31:15,991 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 ! call(reach_error())) ) 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2024-11-18 09:31:16,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:31:16,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:31:16,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:31:16,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:31:16,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:31:16,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-11-18 09:31:17,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:31:17,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:31:17,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-11-18 09:31:17,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ec36c9a/f430ec7f86a74861b648c420c7782d01/FLAG982f332ee [2024-11-18 09:31:18,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ec36c9a/f430ec7f86a74861b648c420c7782d01 [2024-11-18 09:31:18,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:31:18,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:31:18,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:18,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:31:18,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:31:18,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcec629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18, skipping insertion in model container [2024-11-18 09:31:18,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:31:18,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-11-18 09:31:18,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:18,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:31:18,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-11-18 09:31:18,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:18,474 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:31:18,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18 WrapperNode [2024-11-18 09:31:18,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:18,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:18,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:31:18,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:31:18,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,521 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-11-18 09:31:18,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:18,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:31:18,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:31:18,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:31:18,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,554 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-18 09:31:18,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:31:18,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:31:18,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:31:18,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:31:18,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (1/1) ... [2024-11-18 09:31:18,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:18,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:18,603 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-18 09:31:18,612 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-18 09:31:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:31:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:31:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:31:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:31:18,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:31:18,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:31:18,991 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-18 09:31:18,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:31:19,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:31:19,007 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:31:19,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:19 BoogieIcfgContainer [2024-11-18 09:31:19,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:31:19,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:31:19,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:31:19,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:31:19,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:31:18" (1/3) ... [2024-11-18 09:31:19,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bd1449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:19, skipping insertion in model container [2024-11-18 09:31:19,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:18" (2/3) ... [2024-11-18 09:31:19,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bd1449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:19, skipping insertion in model container [2024-11-18 09:31:19,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:19" (3/3) ... [2024-11-18 09:31:19,014 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-11-18 09:31:19,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:31:19,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:31:19,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:31:19,078 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;@76d5ba2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:31:19,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:31:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 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-18 09:31:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 09:31:19,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:19,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:19,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:19,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1425856197, now seen corresponding path program 1 times [2024-11-18 09:31:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525893943] [2024-11-18 09:31:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:19,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-18 09:31:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525893943] [2024-11-18 09:31:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525893943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:31:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863505674] [2024-11-18 09:31:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:19,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:31:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:31:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:31:19,307 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 09:31:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:19,324 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2024-11-18 09:31:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:31:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-11-18 09:31:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:19,332 INFO L225 Difference]: With dead ends: 75 [2024-11-18 09:31:19,332 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 09:31:19,335 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-18 09:31:19,338 INFO L432 NwaCegarLoop]: 83 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, 83 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-18 09:31:19,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 09:31:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-18 09:31:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 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-18 09:31:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2024-11-18 09:31:19,371 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 15 [2024-11-18 09:31:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2024-11-18 09:31:19,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 09:31:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2024-11-18 09:31:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 09:31:19,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:19,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:19,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:31:19,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash -518266215, now seen corresponding path program 1 times [2024-11-18 09:31:19,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:19,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458897897] [2024-11-18 09:31:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:19,516 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-18 09:31:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458897897] [2024-11-18 09:31:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458897897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074121564] [2024-11-18 09:31:19,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:19,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:19,518 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 09:31:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:19,636 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2024-11-18 09:31:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-18 09:31:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:19,638 INFO L225 Difference]: With dead ends: 107 [2024-11-18 09:31:19,639 INFO L226 Difference]: Without dead ends: 70 [2024-11-18 09:31:19,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 09:31:19,640 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:19,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-18 09:31:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-18 09:31:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 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-18 09:31:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-18 09:31:19,654 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2024-11-18 09:31:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:19,655 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-18 09:31:19,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-18 09:31:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-18 09:31:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 09:31:19,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:19,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:31:19,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash 458302340, now seen corresponding path program 1 times [2024-11-18 09:31:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779119403] [2024-11-18 09:31:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:19,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:19,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779119403] [2024-11-18 09:31:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779119403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:19,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:19,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:19,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355462902] [2024-11-18 09:31:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:19,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:19,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:19,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:19,848 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-18 09:31:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,062 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2024-11-18 09:31:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:20,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) Word has length 21 [2024-11-18 09:31:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,063 INFO L225 Difference]: With dead ends: 164 [2024-11-18 09:31:20,064 INFO L226 Difference]: Without dead ends: 127 [2024-11-18 09:31:20,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 09:31:20,065 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-18 09:31:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-11-18 09:31:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 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-18 09:31:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-18 09:31:20,072 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2024-11-18 09:31:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,072 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-18 09:31:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-18 09:31:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-18 09:31:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 09:31:20,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:31:20,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash 93424243, now seen corresponding path program 1 times [2024-11-18 09:31:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380265857] [2024-11-18 09:31:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:31:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380265857] [2024-11-18 09:31:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380265857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434994892] [2024-11-18 09:31:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:20,162 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-18 09:31:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,273 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2024-11-18 09:31:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:20,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 27 [2024-11-18 09:31:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,275 INFO L225 Difference]: With dead ends: 234 [2024-11-18 09:31:20,275 INFO L226 Difference]: Without dead ends: 156 [2024-11-18 09:31:20,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 09:31:20,276 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-18 09:31:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2024-11-18 09:31:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 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-18 09:31:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-11-18 09:31:20,283 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2024-11-18 09:31:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,283 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-11-18 09:31:20,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-18 09:31:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-11-18 09:31:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 09:31:20,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:20,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:31:20,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash -302937854, now seen corresponding path program 1 times [2024-11-18 09:31:20,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836227011] [2024-11-18 09:31:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 09:31:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836227011] [2024-11-18 09:31:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836227011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253784796] [2024-11-18 09:31:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:20,392 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,511 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2024-11-18 09:31:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-18 09:31:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,513 INFO L225 Difference]: With dead ends: 255 [2024-11-18 09:31:20,513 INFO L226 Difference]: Without dead ends: 176 [2024-11-18 09:31:20,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 09:31:20,516 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-18 09:31:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2024-11-18 09:31:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 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-18 09:31:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-18 09:31:20,533 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2024-11-18 09:31:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:20,534 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-18 09:31:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-18 09:31:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:20,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:20,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:20,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:31:20,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1297586116, now seen corresponding path program 1 times [2024-11-18 09:31:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253547520] [2024-11-18 09:31:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:20,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253547520] [2024-11-18 09:31:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253547520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291445818] [2024-11-18 09:31:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:20,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:20,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:20,691 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-18 09:31:20,693 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-18 09:31:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:20,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:20,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:31:20,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291445818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:20,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:20,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-18 09:31:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621242647] [2024-11-18 09:31:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:20,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:20,830 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-18 09:31:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:20,992 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-11-18 09:31:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 29 [2024-11-18 09:31:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:20,993 INFO L225 Difference]: With dead ends: 230 [2024-11-18 09:31:20,993 INFO L226 Difference]: Without dead ends: 154 [2024-11-18 09:31:20,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:20,995 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:20,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-18 09:31:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-18 09:31:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 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-18 09:31:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-18 09:31:21,002 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2024-11-18 09:31:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:21,002 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-18 09:31:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-18 09:31:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-18 09:31:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 09:31:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:21,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:21,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:21,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 09:31:21,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1927695377, now seen corresponding path program 1 times [2024-11-18 09:31:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722016230] [2024-11-18 09:31:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722016230] [2024-11-18 09:31:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722016230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857748919] [2024-11-18 09:31:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:21,354 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-18 09:31:21,362 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-18 09:31:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:21,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:21,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:21,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857748919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:21,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:21,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-18 09:31:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334291577] [2024-11-18 09:31:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:21,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:21,474 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-18 09:31:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:21,608 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2024-11-18 09:31:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2024-11-18 09:31:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:21,610 INFO L225 Difference]: With dead ends: 288 [2024-11-18 09:31:21,610 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 09:31:21,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:21,611 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:21,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 09:31:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2024-11-18 09:31:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 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-18 09:31:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-18 09:31:21,626 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2024-11-18 09:31:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:21,626 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-18 09:31:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-18 09:31:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-18 09:31:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 09:31:21,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:21,627 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:21,645 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-18 09:31:21,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 09:31:21,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -977713378, now seen corresponding path program 1 times [2024-11-18 09:31:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107873029] [2024-11-18 09:31:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 09:31:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107873029] [2024-11-18 09:31:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107873029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:21,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570579459] [2024-11-18 09:31:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:21,950 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 09:31:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:21,956 INFO L93 Difference]: Finished difference Result 289 states and 401 transitions. [2024-11-18 09:31:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 41 [2024-11-18 09:31:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:21,957 INFO L225 Difference]: With dead ends: 289 [2024-11-18 09:31:21,957 INFO L226 Difference]: Without dead ends: 148 [2024-11-18 09:31:21,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:21,958 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:21,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-18 09:31:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-18 09:31:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 147 states have internal predecessors, (202), 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-18 09:31:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2024-11-18 09:31:21,963 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 41 [2024-11-18 09:31:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:21,964 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2024-11-18 09:31:21,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 09:31:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2024-11-18 09:31:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 09:31:21,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:21,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 09:31:21,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1281878687, now seen corresponding path program 1 times [2024-11-18 09:31:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796509579] [2024-11-18 09:31:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796509579] [2024-11-18 09:31:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796509579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329358957] [2024-11-18 09:31:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:22,036 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-18 09:31:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,046 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2024-11-18 09:31:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) Word has length 47 [2024-11-18 09:31:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,047 INFO L225 Difference]: With dead ends: 219 [2024-11-18 09:31:22,047 INFO L226 Difference]: Without dead ends: 178 [2024-11-18 09:31:22,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:22,048 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-18 09:31:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-18 09:31:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.344632768361582) internal successors, (238), 177 states have internal predecessors, (238), 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-18 09:31:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2024-11-18 09:31:22,062 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 47 [2024-11-18 09:31:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2024-11-18 09:31:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-18 09:31:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2024-11-18 09:31:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 09:31:22,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:31:22,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1354265245, now seen corresponding path program 1 times [2024-11-18 09:31:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942597116] [2024-11-18 09:31:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942597116] [2024-11-18 09:31:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942597116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489961001] [2024-11-18 09:31:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:22,259 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-18 09:31:22,260 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-18 09:31:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:31:22,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:22,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489961001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:22,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-18 09:31:22,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696366261] [2024-11-18 09:31:22,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:22,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:22,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:22,350 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-18 09:31:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,419 INFO L93 Difference]: Finished difference Result 354 states and 477 transitions. [2024-11-18 09:31:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 47 [2024-11-18 09:31:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,420 INFO L225 Difference]: With dead ends: 354 [2024-11-18 09:31:22,420 INFO L226 Difference]: Without dead ends: 169 [2024-11-18 09:31:22,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:22,421 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-18 09:31:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136. [2024-11-18 09:31:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 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-18 09:31:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2024-11-18 09:31:22,427 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 47 [2024-11-18 09:31:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,427 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2024-11-18 09:31:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-18 09:31:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2024-11-18 09:31:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 09:31:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,430 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,448 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-18 09:31:22,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:22,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -872043687, now seen corresponding path program 1 times [2024-11-18 09:31:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908634721] [2024-11-18 09:31:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 09:31:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908634721] [2024-11-18 09:31:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908634721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:22,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541927615] [2024-11-18 09:31:22,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:22,760 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-18 09:31:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:22,930 INFO L93 Difference]: Finished difference Result 501 states and 654 transitions. [2024-11-18 09:31:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:22,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 68 [2024-11-18 09:31:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:22,935 INFO L225 Difference]: With dead ends: 501 [2024-11-18 09:31:22,935 INFO L226 Difference]: Without dead ends: 381 [2024-11-18 09:31:22,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:22,936 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 137 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:22,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 251 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-18 09:31:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 136. [2024-11-18 09:31:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 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-18 09:31:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2024-11-18 09:31:22,946 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 68 [2024-11-18 09:31:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2024-11-18 09:31:22,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-18 09:31:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2024-11-18 09:31:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 09:31:22,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:22,947 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 09:31:22,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1719260976, now seen corresponding path program 1 times [2024-11-18 09:31:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714706417] [2024-11-18 09:31:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-18 09:31:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714706417] [2024-11-18 09:31:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714706417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27122080] [2024-11-18 09:31:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:23,136 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-18 09:31:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:23,221 INFO L93 Difference]: Finished difference Result 438 states and 575 transitions. [2024-11-18 09:31:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:31:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 69 [2024-11-18 09:31:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:23,223 INFO L225 Difference]: With dead ends: 438 [2024-11-18 09:31:23,223 INFO L226 Difference]: Without dead ends: 318 [2024-11-18 09:31:23,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:23,224 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 139 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:23,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 240 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-18 09:31:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 204. [2024-11-18 09:31:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 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-18 09:31:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions. [2024-11-18 09:31:23,233 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 69 [2024-11-18 09:31:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:23,233 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 270 transitions. [2024-11-18 09:31:23,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-18 09:31:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions. [2024-11-18 09:31:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 09:31:23,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:23,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 09:31:23,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:23,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -929068338, now seen corresponding path program 1 times [2024-11-18 09:31:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320957429] [2024-11-18 09:31:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-18 09:31:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320957429] [2024-11-18 09:31:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320957429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083439121] [2024-11-18 09:31:23,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:23,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:23,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:23,482 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-18 09:31:23,485 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-18 09:31:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:23,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:31:23,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-18 09:31:23,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083439121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:23,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-18 09:31:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592343544] [2024-11-18 09:31:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:31:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:31:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:31:23,656 INFO L87 Difference]: Start difference. First operand 204 states and 270 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-18 09:31:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:23,978 INFO L93 Difference]: Finished difference Result 988 states and 1292 transitions. [2024-11-18 09:31:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 09:31:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 69 [2024-11-18 09:31:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:23,981 INFO L225 Difference]: With dead ends: 988 [2024-11-18 09:31:23,981 INFO L226 Difference]: Without dead ends: 736 [2024-11-18 09:31:23,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:31:23,982 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 233 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:23,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 491 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:31:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-18 09:31:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 187. [2024-11-18 09:31:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.2903225806451613) internal successors, (240), 186 states have internal predecessors, (240), 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-18 09:31:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 240 transitions. [2024-11-18 09:31:24,004 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 240 transitions. Word has length 69 [2024-11-18 09:31:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:24,005 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 240 transitions. [2024-11-18 09:31:24,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-18 09:31:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 240 transitions. [2024-11-18 09:31:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 09:31:24,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:24,006 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:24,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:24,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:24,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:24,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1228855143, now seen corresponding path program 1 times [2024-11-18 09:31:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:24,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103782634] [2024-11-18 09:31:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-18 09:31:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103782634] [2024-11-18 09:31:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103782634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807737906] [2024-11-18 09:31:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:24,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:24,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 09:31:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:24,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:31:24,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 09:31:24,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 09:31:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807737906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:24,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2024-11-18 09:31:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197405688] [2024-11-18 09:31:24,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 09:31:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 09:31:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:31:24,600 INFO L87 Difference]: Start difference. First operand 187 states and 240 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-18 09:31:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:25,195 INFO L93 Difference]: Finished difference Result 1010 states and 1369 transitions. [2024-11-18 09:31:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 09:31:25,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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 71 [2024-11-18 09:31:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:25,197 INFO L225 Difference]: With dead ends: 1010 [2024-11-18 09:31:25,197 INFO L226 Difference]: Without dead ends: 793 [2024-11-18 09:31:25,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-18 09:31:25,198 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 338 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:25,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 257 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:31:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-18 09:31:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 667. [2024-11-18 09:31:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.2972972972972974) internal successors, (864), 666 states have internal predecessors, (864), 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-18 09:31:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 864 transitions. [2024-11-18 09:31:25,220 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 864 transitions. Word has length 71 [2024-11-18 09:31:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:25,220 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 864 transitions. [2024-11-18 09:31:25,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 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-18 09:31:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 864 transitions. [2024-11-18 09:31:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:25,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:25,222 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:25,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 09:31:25,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-18 09:31:25,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 545967452, now seen corresponding path program 1 times [2024-11-18 09:31:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475768261] [2024-11-18 09:31:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 09:31:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:25,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475768261] [2024-11-18 09:31:25,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475768261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:25,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177497288] [2024-11-18 09:31:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:25,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:25,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 09:31:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:26,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 09:31:26,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:26,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 09:31:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177497288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:26,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-18 09:31:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131150272] [2024-11-18 09:31:26,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 09:31:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:26,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 09:31:26,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:31:26,747 INFO L87 Difference]: Start difference. First operand 667 states and 864 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-18 09:31:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:27,059 INFO L93 Difference]: Finished difference Result 1464 states and 1851 transitions. [2024-11-18 09:31:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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 73 [2024-11-18 09:31:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:27,062 INFO L225 Difference]: With dead ends: 1464 [2024-11-18 09:31:27,062 INFO L226 Difference]: Without dead ends: 820 [2024-11-18 09:31:27,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2024-11-18 09:31:27,063 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 280 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:27,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 606 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-18 09:31:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 523. [2024-11-18 09:31:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.264367816091954) internal successors, (660), 522 states have internal predecessors, (660), 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-18 09:31:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 660 transitions. [2024-11-18 09:31:27,099 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 660 transitions. Word has length 73 [2024-11-18 09:31:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:27,099 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 660 transitions. [2024-11-18 09:31:27,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-18 09:31:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 660 transitions. [2024-11-18 09:31:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:27,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:27,100 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:27,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 09:31:27,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 09:31:27,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 36494362, now seen corresponding path program 2 times [2024-11-18 09:31:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597029736] [2024-11-18 09:31:27,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:27,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:27,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 09:31:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597029736] [2024-11-18 09:31:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597029736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211515119] [2024-11-18 09:31:27,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:27,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:27,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 09:31:27,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:27,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:27,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 09:31:27,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:28,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211515119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:28,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:28,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-11-18 09:31:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848768961] [2024-11-18 09:31:28,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:28,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 09:31:28,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:28,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 09:31:28,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:31:28,168 INFO L87 Difference]: Start difference. First operand 523 states and 660 transitions. Second operand has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 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-18 09:31:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:29,190 INFO L93 Difference]: Finished difference Result 1889 states and 2337 transitions. [2024-11-18 09:31:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-18 09:31:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 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 73 [2024-11-18 09:31:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:29,195 INFO L225 Difference]: With dead ends: 1889 [2024-11-18 09:31:29,195 INFO L226 Difference]: Without dead ends: 1549 [2024-11-18 09:31:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=389, Invalid=1417, Unknown=0, NotChecked=0, Total=1806 [2024-11-18 09:31:29,196 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 386 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:29,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1489 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:31:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2024-11-18 09:31:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 902. [2024-11-18 09:31:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.2974472807991122) internal successors, (1169), 901 states have internal predecessors, (1169), 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-18 09:31:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1169 transitions. [2024-11-18 09:31:29,234 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1169 transitions. Word has length 73 [2024-11-18 09:31:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1169 transitions. [2024-11-18 09:31:29,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 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-18 09:31:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1169 transitions. [2024-11-18 09:31:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 09:31:29,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:29,235 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:29,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:29,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:29,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 460141084, now seen corresponding path program 3 times [2024-11-18 09:31:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:29,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180520730] [2024-11-18 09:31:29,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:31:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:29,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 09:31:29,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 09:31:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180520730] [2024-11-18 09:31:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180520730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189462136] [2024-11-18 09:31:30,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:31:30,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:30,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:30,211 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 09:31:30,428 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 09:31:30,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:30,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 09:31:30,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:30,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189462136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:31,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 26 [2024-11-18 09:31:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677026924] [2024-11-18 09:31:31,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:31,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-18 09:31:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-18 09:31:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-11-18 09:31:31,135 INFO L87 Difference]: Start difference. First operand 902 states and 1169 transitions. Second operand has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 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-18 09:31:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:36,189 INFO L93 Difference]: Finished difference Result 7999 states and 10092 transitions. [2024-11-18 09:31:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-11-18 09:31:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 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 73 [2024-11-18 09:31:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:36,206 INFO L225 Difference]: With dead ends: 7999 [2024-11-18 09:31:36,207 INFO L226 Difference]: Without dead ends: 7985 [2024-11-18 09:31:36,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6846 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2406, Invalid=17616, Unknown=0, NotChecked=0, Total=20022 [2024-11-18 09:31:36,212 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 968 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:36,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2822 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 09:31:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2024-11-18 09:31:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 2932. [2024-11-18 09:31:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2931 states have (on average 1.3476629136813374) internal successors, (3950), 2931 states have internal predecessors, (3950), 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-18 09:31:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3950 transitions. [2024-11-18 09:31:36,348 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3950 transitions. Word has length 73 [2024-11-18 09:31:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:36,349 INFO L471 AbstractCegarLoop]: Abstraction has 2932 states and 3950 transitions. [2024-11-18 09:31:36,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 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-18 09:31:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3950 transitions. [2024-11-18 09:31:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-18 09:31:36,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:36,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:36,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:36,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 09:31:36,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:36,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1549984551, now seen corresponding path program 1 times [2024-11-18 09:31:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:36,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415051249] [2024-11-18 09:31:36,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:36,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 09:31:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415051249] [2024-11-18 09:31:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415051249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436851946] [2024-11-18 09:31:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:36,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:36,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:36,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:36,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 09:31:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:37,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:31:37,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-18 09:31:37,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436851946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:31:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-18 09:31:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068576495] [2024-11-18 09:31:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:37,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:31:37,221 INFO L87 Difference]: Start difference. First operand 2932 states and 3950 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-18 09:31:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:37,353 INFO L93 Difference]: Finished difference Result 2949 states and 3973 transitions. [2024-11-18 09:31:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 75 [2024-11-18 09:31:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:37,360 INFO L225 Difference]: With dead ends: 2949 [2024-11-18 09:31:37,360 INFO L226 Difference]: Without dead ends: 2944 [2024-11-18 09:31:37,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:31:37,361 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:37,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2024-11-18 09:31:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2941. [2024-11-18 09:31:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2940 states have (on average 1.3482993197278912) internal successors, (3964), 2940 states have internal predecessors, (3964), 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-18 09:31:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3964 transitions. [2024-11-18 09:31:37,466 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3964 transitions. Word has length 75 [2024-11-18 09:31:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:37,467 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 3964 transitions. [2024-11-18 09:31:37,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-18 09:31:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3964 transitions. [2024-11-18 09:31:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-18 09:31:37,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:37,469 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:37,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:37,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-18 09:31:37,669 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1539904125, now seen corresponding path program 1 times [2024-11-18 09:31:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:37,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038167043] [2024-11-18 09:31:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038167043] [2024-11-18 09:31:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038167043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866236069] [2024-11-18 09:31:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:37,926 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:37,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 09:31:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:38,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 09:31:38,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:38,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 09:31:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866236069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:38,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2024-11-18 09:31:38,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520235983] [2024-11-18 09:31:38,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:38,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-18 09:31:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-18 09:31:38,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2024-11-18 09:31:38,488 INFO L87 Difference]: Start difference. First operand 2941 states and 3964 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 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-18 09:31:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:39,758 INFO L93 Difference]: Finished difference Result 7164 states and 9358 transitions. [2024-11-18 09:31:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-18 09:31:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 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 75 [2024-11-18 09:31:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:39,778 INFO L225 Difference]: With dead ends: 7164 [2024-11-18 09:31:39,778 INFO L226 Difference]: Without dead ends: 7146 [2024-11-18 09:31:39,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=752, Invalid=3030, Unknown=0, NotChecked=0, Total=3782 [2024-11-18 09:31:39,782 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 481 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:39,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1093 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 09:31:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2024-11-18 09:31:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 2935. [2024-11-18 09:31:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2935 states, 2934 states have (on average 1.3486707566462168) internal successors, (3957), 2934 states have internal predecessors, (3957), 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-18 09:31:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 3957 transitions. [2024-11-18 09:31:39,928 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 3957 transitions. Word has length 75 [2024-11-18 09:31:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:39,928 INFO L471 AbstractCegarLoop]: Abstraction has 2935 states and 3957 transitions. [2024-11-18 09:31:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 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-18 09:31:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 3957 transitions. [2024-11-18 09:31:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 09:31:39,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:39,930 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:39,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 09:31:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:40,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash -752302432, now seen corresponding path program 1 times [2024-11-18 09:31:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754241484] [2024-11-18 09:31:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:31:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754241484] [2024-11-18 09:31:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754241484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:31:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088260957] [2024-11-18 09:31:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:40,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:31:40,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 09:31:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:40,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 09:31:40,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:40,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 09:31:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088260957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:40,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:31:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-18 09:31:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132350999] [2024-11-18 09:31:40,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 09:31:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:31:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 09:31:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:31:40,757 INFO L87 Difference]: Start difference. First operand 2935 states and 3957 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 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-18 09:31:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:41,745 INFO L93 Difference]: Finished difference Result 8190 states and 10630 transitions. [2024-11-18 09:31:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 09:31:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 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 76 [2024-11-18 09:31:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:41,764 INFO L225 Difference]: With dead ends: 8190 [2024-11-18 09:31:41,764 INFO L226 Difference]: Without dead ends: 8185 [2024-11-18 09:31:41,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2024-11-18 09:31:41,766 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 622 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:41,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 950 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2024-11-18 09:31:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 3411. [2024-11-18 09:31:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 3410 states have (on average 1.3724340175953078) internal successors, (4680), 3410 states have internal predecessors, (4680), 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-18 09:31:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4680 transitions. [2024-11-18 09:31:41,918 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4680 transitions. Word has length 76 [2024-11-18 09:31:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:41,918 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 4680 transitions. [2024-11-18 09:31:41,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 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-18 09:31:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4680 transitions. [2024-11-18 09:31:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-18 09:31:41,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:41,921 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:41,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:42,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:31:42,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:42,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1791189956, now seen corresponding path program 1 times [2024-11-18 09:31:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:31:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624951145] [2024-11-18 09:31:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:31:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:31:42,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:31:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:31:42,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:31:42,261 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:31:42,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:31:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 09:31:42,265 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:42,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:31:42,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:31:42 BoogieIcfgContainer [2024-11-18 09:31:42,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:31:42,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:31:42,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:31:42,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:31:42,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:19" (3/4) ... [2024-11-18 09:31:42,339 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:31:42,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:31:42,340 INFO L158 Benchmark]: Toolchain (without parser) took 24202.57ms. Allocated memory was 153.1MB in the beginning and 645.9MB in the end (delta: 492.8MB). Free memory was 83.6MB in the beginning and 568.4MB in the end (delta: -484.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,341 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:31:42,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.55ms. Allocated memory is still 153.1MB. Free memory was 83.4MB in the beginning and 118.8MB in the end (delta: -35.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.06ms. Allocated memory is still 153.1MB. Free memory was 118.3MB in the beginning and 115.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,341 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 153.1MB. Free memory was 115.7MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,341 INFO L158 Benchmark]: RCFGBuilder took 438.37ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 90.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,342 INFO L158 Benchmark]: TraceAbstraction took 23326.73ms. Allocated memory was 153.1MB in the beginning and 645.9MB in the end (delta: 492.8MB). Free memory was 89.5MB in the beginning and 568.4MB in the end (delta: -478.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-18 09:31:42,342 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 645.9MB. Free memory is still 568.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:31:42,343 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.55ms. Allocated memory is still 153.1MB. Free memory was 83.4MB in the beginning and 118.8MB in the end (delta: -35.4MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.06ms. Allocated memory is still 153.1MB. Free memory was 118.3MB in the beginning and 115.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.98ms. Allocated memory is still 153.1MB. Free memory was 115.7MB in the beginning and 112.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.37ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 90.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23326.73ms. Allocated memory was 153.1MB in the beginning and 645.9MB in the end (delta: 492.8MB). Free memory was 89.5MB in the beginning and 568.4MB in the end (delta: -478.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 645.9MB. Free memory is still 568.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L68] nb = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 [L91] partial_sum = partial_sum + b1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] partial_sum = partial_sum + b2 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L89] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] partial_sum = partial_sum + b3 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4015 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4015 mSDsluCounter, 9706 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7841 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6573 IncrementalHoareTripleChecker+Invalid, 6945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 1865 mSDtfsCounter, 6573 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1552 GetRequests, 1162 SyntacticMatches, 3 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8711 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3411occurred in iteration=20, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 16252 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1800 NumberOfCodeBlocks, 1800 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2127 ConstructedInterpolants, 0 QuantifiedInterpolants, 11650 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1958 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 1441/2149 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 09:31:42,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:31:44,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:31:44,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:31:44,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:31:44,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:31:44,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:31:44,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:31:44,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:31:44,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:31:44,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:31:44,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:31:44,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:31:44,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:31:44,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:31:44,474 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:31:44,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:31:44,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:31:44,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:31:44,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:31:44,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:31:44,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:31:44,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:31:44,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:31:44,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:31:44,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:31:44,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:31:44,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:44,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:31:44,484 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:31:44,485 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:31:44,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:31:44,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:31:44,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:31:44,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:31:44,487 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 ! call(reach_error())) ) 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2024-11-18 09:31:44,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:31:44,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:31:44,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:31:44,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:31:44,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:31:44,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-11-18 09:31:46,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:31:46,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:31:46,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2024-11-18 09:31:46,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/645da4e15/c3160211bebd48b7bbc5f3a1a3f7328b/FLAG2565fd562 [2024-11-18 09:31:46,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/645da4e15/c3160211bebd48b7bbc5f3a1a3f7328b [2024-11-18 09:31:46,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:31:46,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:31:46,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:46,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:31:46,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:31:46,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:46" (1/1) ... [2024-11-18 09:31:46,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f99eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:46, skipping insertion in model container [2024-11-18 09:31:46,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:31:46" (1/1) ... [2024-11-18 09:31:46,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:31:46,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-11-18 09:31:46,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:47,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:31:47,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2024-11-18 09:31:47,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:31:47,054 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:31:47,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47 WrapperNode [2024-11-18 09:31:47,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:31:47,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:47,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:31:47,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:31:47,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,096 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-18 09:31:47,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:31:47,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:31:47,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:31:47,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:31:47,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,125 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-18 09:31:47,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:31:47,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:31:47,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:31:47,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:31:47,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (1/1) ... [2024-11-18 09:31:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:31:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:31:47,178 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-18 09:31:47,184 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-18 09:31:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:31:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 09:31:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:31:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:31:47,281 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:31:47,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:31:47,570 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-18 09:31:47,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:31:47,584 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:31:47,584 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 09:31:47,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:47 BoogieIcfgContainer [2024-11-18 09:31:47,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:31:47,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:31:47,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:31:47,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:31:47,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:31:46" (1/3) ... [2024-11-18 09:31:47,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9d4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:47, skipping insertion in model container [2024-11-18 09:31:47,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:31:47" (2/3) ... [2024-11-18 09:31:47,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9d4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:31:47, skipping insertion in model container [2024-11-18 09:31:47,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:31:47" (3/3) ... [2024-11-18 09:31:47,595 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-11-18 09:31:47,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:31:47,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:31:47,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:31:47,656 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;@58655876, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:31:47,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:31:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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-18 09:31:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:31:47,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:47,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:47,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-18 09:31:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070990064] [2024-11-18 09:31:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:47,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:47,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 09:31:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:47,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 09:31:47,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:47,815 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-18 09:31:47,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:47,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070990064] [2024-11-18 09:31:47,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070990064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:47,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:47,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:31:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596052123] [2024-11-18 09:31:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:47,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:31:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:31:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:31:47,843 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 6.0) internal successors, (12), 2 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-18 09:31:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:47,855 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-18 09:31:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:31:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-18 09:31:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:47,863 INFO L225 Difference]: With dead ends: 57 [2024-11-18 09:31:47,863 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 09:31:47,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-18 09:31:47,868 INFO L432 NwaCegarLoop]: 68 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, 68 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-18 09:31:47,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 09:31:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 09:31:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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-18 09:31:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-18 09:31:47,893 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-18 09:31:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:47,894 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-18 09:31:47,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-18 09:31:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-18 09:31:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 09:31:47,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:47,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:47,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:48,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:48,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-18 09:31:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071699779] [2024-11-18 09:31:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:48,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:48,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 09:31:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:48,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:31:48,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:48,171 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-18 09:31:48,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:48,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071699779] [2024-11-18 09:31:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071699779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697183740] [2024-11-18 09:31:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:48,174 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.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-18 09:31:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:48,264 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2024-11-18 09:31:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:48,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-18 09:31:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:48,266 INFO L225 Difference]: With dead ends: 101 [2024-11-18 09:31:48,266 INFO L226 Difference]: Without dead ends: 73 [2024-11-18 09:31:48,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-18 09:31:48,267 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:48,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-18 09:31:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-18 09:31:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 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-18 09:31:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-18 09:31:48,274 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 12 [2024-11-18 09:31:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-18 09:31:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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-18 09:31:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-18 09:31:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:31:48,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:48,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:48,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 09:31:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2024-11-18 09:31:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916475235] [2024-11-18 09:31:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:48,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:48,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:48,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 09:31:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:48,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:48,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:48,563 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-18 09:31:48,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:48,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916475235] [2024-11-18 09:31:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916475235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703148201] [2024-11-18 09:31:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:48,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:48,568 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:48,585 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2024-11-18 09:31:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 09:31:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:48,586 INFO L225 Difference]: With dead ends: 83 [2024-11-18 09:31:48,586 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 09:31:48,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-18 09:31:48,587 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:48,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 09:31:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-18 09:31:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 51 states have internal predecessors, (77), 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-18 09:31:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-11-18 09:31:48,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 13 [2024-11-18 09:31:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:48,609 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-11-18 09:31:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-11-18 09:31:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 09:31:48,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:48,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:48,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 09:31:48,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:48,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2024-11-18 09:31:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90311487] [2024-11-18 09:31:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:48,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:48,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:48,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:48,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 09:31:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:48,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:31:48,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:48,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:48,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90311487] [2024-11-18 09:31:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90311487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:31:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364594106] [2024-11-18 09:31:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:31:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:31:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:31:48,882 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-18 09:31:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:48,960 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2024-11-18 09:31:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:31:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-18 09:31:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:48,961 INFO L225 Difference]: With dead ends: 130 [2024-11-18 09:31:48,961 INFO L226 Difference]: Without dead ends: 89 [2024-11-18 09:31:48,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-18 09:31:48,962 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 65 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:48,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 121 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-18 09:31:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2024-11-18 09:31:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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-18 09:31:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-18 09:31:48,968 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 25 [2024-11-18 09:31:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:48,968 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-18 09:31:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-18 09:31:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-18 09:31:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 09:31:48,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:48,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:48,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 09:31:49,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:49,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2024-11-18 09:31:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138540737] [2024-11-18 09:31:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:49,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:49,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:49,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:49,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 09:31:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:49,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:49,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:49,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:49,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138540737] [2024-11-18 09:31:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138540737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354290334] [2024-11-18 09:31:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:49,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:49,243 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:49,315 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2024-11-18 09:31:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:49,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 09:31:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:49,317 INFO L225 Difference]: With dead ends: 166 [2024-11-18 09:31:49,317 INFO L226 Difference]: Without dead ends: 125 [2024-11-18 09:31:49,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:49,318 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 101 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:49,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 237 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-18 09:31:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 57. [2024-11-18 09:31:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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-18 09:31:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-18 09:31:49,324 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 26 [2024-11-18 09:31:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-18 09:31:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-18 09:31:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 09:31:49,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:49,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:49,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-18 09:31:49,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:49,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:49,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2024-11-18 09:31:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246026056] [2024-11-18 09:31:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:49,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:49,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:49,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 09:31:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:31:49,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:49,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:49,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246026056] [2024-11-18 09:31:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246026056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:31:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996892475] [2024-11-18 09:31:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:49,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:31:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:31:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:31:49,617 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) 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-18 09:31:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:49,986 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2024-11-18 09:31:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 09:31:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) 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 27 [2024-11-18 09:31:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:49,988 INFO L225 Difference]: With dead ends: 215 [2024-11-18 09:31:49,989 INFO L226 Difference]: Without dead ends: 170 [2024-11-18 09:31:49,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-18 09:31:49,990 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 225 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:49,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 406 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:31:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-18 09:31:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 54. [2024-11-18 09:31:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 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-18 09:31:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-18 09:31:50,003 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 27 [2024-11-18 09:31:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:50,003 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-18 09:31:50,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) 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-18 09:31:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-18 09:31:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:50,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:50,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:50,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-18 09:31:50,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2024-11-18 09:31:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141843715] [2024-11-18 09:31:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:50,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:50,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:50,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-18 09:31:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:50,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:31:50,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:50,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:50,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141843715] [2024-11-18 09:31:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141843715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:50,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:31:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721163148] [2024-11-18 09:31:50,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:31:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:50,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:31:50,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:31:50,275 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:50,289 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2024-11-18 09:31:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:31:50,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-18 09:31:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:50,290 INFO L225 Difference]: With dead ends: 77 [2024-11-18 09:31:50,290 INFO L226 Difference]: Without dead ends: 64 [2024-11-18 09:31:50,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-18 09:31:50,291 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:50,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:31:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-18 09:31:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-18 09:31:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 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-18 09:31:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-11-18 09:31:50,297 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 29 [2024-11-18 09:31:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:50,297 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-11-18 09:31:50,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-18 09:31:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 09:31:50,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:50,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:50,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 09:31:50,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:50,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2024-11-18 09:31:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:50,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350601357] [2024-11-18 09:31:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:50,502 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:50,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-18 09:31:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:50,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:50,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:50,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:50,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350601357] [2024-11-18 09:31:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350601357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510483024] [2024-11-18 09:31:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:50,598 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:50,689 INFO L93 Difference]: Finished difference Result 142 states and 208 transitions. [2024-11-18 09:31:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-18 09:31:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:50,690 INFO L225 Difference]: With dead ends: 142 [2024-11-18 09:31:50,690 INFO L226 Difference]: Without dead ends: 89 [2024-11-18 09:31:50,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-18 09:31:50,691 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:50,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-18 09:31:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-18 09:31:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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-18 09:31:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2024-11-18 09:31:50,697 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 29 [2024-11-18 09:31:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:50,697 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2024-11-18 09:31:50,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:31:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-11-18 09:31:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 09:31:50,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:50,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:50,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-18 09:31:50,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:50,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1538767779, now seen corresponding path program 1 times [2024-11-18 09:31:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:50,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990705969] [2024-11-18 09:31:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:50,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:50,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:50,902 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:50,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-18 09:31:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:50,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:31:50,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:51,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:51,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990705969] [2024-11-18 09:31:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990705969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:51,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:31:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655636371] [2024-11-18 09:31:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:51,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:31:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:31:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:31:51,010 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-18 09:31:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:51,112 INFO L93 Difference]: Finished difference Result 216 states and 289 transitions. [2024-11-18 09:31:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:31:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2024-11-18 09:31:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:51,113 INFO L225 Difference]: With dead ends: 216 [2024-11-18 09:31:51,113 INFO L226 Difference]: Without dead ends: 146 [2024-11-18 09:31:51,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-18 09:31:51,114 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 47 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:51,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 114 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-18 09:31:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-18 09:31:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 143 states have internal predecessors, (191), 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-18 09:31:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2024-11-18 09:31:51,122 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 42 [2024-11-18 09:31:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:51,122 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2024-11-18 09:31:51,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-18 09:31:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2024-11-18 09:31:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 09:31:51,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:51,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:51,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-18 09:31:51,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -390869275, now seen corresponding path program 1 times [2024-11-18 09:31:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061137211] [2024-11-18 09:31:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:51,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:51,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-18 09:31:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:51,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:51,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:51,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:31:51,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061137211] [2024-11-18 09:31:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061137211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:31:51,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:31:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 09:31:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244777415] [2024-11-18 09:31:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:31:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:31:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:51,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:31:51,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:51,432 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-18 09:31:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:51,605 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2024-11-18 09:31:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:31:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-11-18 09:31:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:51,606 INFO L225 Difference]: With dead ends: 279 [2024-11-18 09:31:51,606 INFO L226 Difference]: Without dead ends: 209 [2024-11-18 09:31:51,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:31:51,607 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:51,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 212 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-18 09:31:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 144. [2024-11-18 09:31:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 143 states have internal predecessors, (191), 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-18 09:31:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2024-11-18 09:31:51,614 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 43 [2024-11-18 09:31:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:51,614 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2024-11-18 09:31:51,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-18 09:31:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2024-11-18 09:31:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 09:31:51,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:51,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:51,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:51,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2024-11-18 09:31:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795410923] [2024-11-18 09:31:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:51,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:51,822 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-18 09:31:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:51,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:31:51,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:52,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:52,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795410923] [2024-11-18 09:31:52,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795410923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:52,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 09:31:52,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693412792] [2024-11-18 09:31:52,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:31:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:31:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:31:52,108 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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-18 09:31:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:52,338 INFO L93 Difference]: Finished difference Result 425 states and 622 transitions. [2024-11-18 09:31:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 09:31:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 44 [2024-11-18 09:31:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:52,340 INFO L225 Difference]: With dead ends: 425 [2024-11-18 09:31:52,340 INFO L226 Difference]: Without dead ends: 298 [2024-11-18 09:31:52,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-18 09:31:52,341 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 229 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:52,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 113 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-18 09:31:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 234. [2024-11-18 09:31:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 233 states have internal predecessors, (327), 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-18 09:31:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 327 transitions. [2024-11-18 09:31:52,351 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 327 transitions. Word has length 44 [2024-11-18 09:31:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:52,351 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 327 transitions. [2024-11-18 09:31:52,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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-18 09:31:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 327 transitions. [2024-11-18 09:31:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:52,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:52,353 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:52,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-18 09:31:52,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:52,556 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:52,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1373021230, now seen corresponding path program 1 times [2024-11-18 09:31:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750658559] [2024-11-18 09:31:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:31:52,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:52,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:52,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-18 09:31:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:31:52,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:31:52,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:52,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-18 09:31:52,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750658559] [2024-11-18 09:31:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750658559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:52,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 09:31:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859504738] [2024-11-18 09:31:52,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:52,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:31:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:31:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:31:52,881 INFO L87 Difference]: Start difference. First operand 234 states and 327 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-18 09:31:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:53,195 INFO L93 Difference]: Finished difference Result 741 states and 1021 transitions. [2024-11-18 09:31:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 70 [2024-11-18 09:31:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:53,197 INFO L225 Difference]: With dead ends: 741 [2024-11-18 09:31:53,197 INFO L226 Difference]: Without dead ends: 524 [2024-11-18 09:31:53,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:31:53,198 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 224 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:53,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 344 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:31:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-18 09:31:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 324. [2024-11-18 09:31:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.414860681114551) internal successors, (457), 323 states have internal predecessors, (457), 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-18 09:31:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2024-11-18 09:31:53,212 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 70 [2024-11-18 09:31:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:53,212 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2024-11-18 09:31:53,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-18 09:31:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2024-11-18 09:31:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:53,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:53,214 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:53,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-18 09:31:53,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,415 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:53,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 2 times [2024-11-18 09:31:53,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:53,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967371593] [2024-11-18 09:31:53,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:31:53,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:53,418 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:53,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-18 09:31:53,462 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:31:53,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:53,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 09:31:53,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 09:31:53,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 09:31:53,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967371593] [2024-11-18 09:31:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967371593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:53,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:53,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-18 09:31:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709790424] [2024-11-18 09:31:53,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 09:31:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 09:31:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 09:31:53,627 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-18 09:31:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:31:53,823 INFO L93 Difference]: Finished difference Result 871 states and 1189 transitions. [2024-11-18 09:31:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 09:31:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2024-11-18 09:31:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:31:53,825 INFO L225 Difference]: With dead ends: 871 [2024-11-18 09:31:53,825 INFO L226 Difference]: Without dead ends: 564 [2024-11-18 09:31:53,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:31:53,826 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 235 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:31:53,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 293 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:31:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-18 09:31:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 324. [2024-11-18 09:31:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.3962848297213621) internal successors, (451), 323 states have internal predecessors, (451), 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-18 09:31:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2024-11-18 09:31:53,840 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 70 [2024-11-18 09:31:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:31:53,841 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2024-11-18 09:31:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-18 09:31:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2024-11-18 09:31:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:31:53,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:31:53,842 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:31:53,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-18 09:31:54,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:31:54,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:31:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 3 times [2024-11-18 09:31:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:31:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834190615] [2024-11-18 09:31:54,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:31:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:31:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:31:54,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:31:54,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-18 09:31:54,092 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 09:31:54,092 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:31:54,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-18 09:31:54,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:31:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:56,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:31:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:31:58,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:31:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834190615] [2024-11-18 09:31:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834190615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:31:58,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:31:58,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2024-11-18 09:31:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596643944] [2024-11-18 09:31:58,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:31:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-18 09:31:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:31:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-18 09:31:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 09:31:58,741 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 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-18 09:32:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:10,596 INFO L93 Difference]: Finished difference Result 1981 states and 2697 transitions. [2024-11-18 09:32:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-18 09:32:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 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 70 [2024-11-18 09:32:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:10,604 INFO L225 Difference]: With dead ends: 1981 [2024-11-18 09:32:10,604 INFO L226 Difference]: Without dead ends: 1812 [2024-11-18 09:32:10,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3671 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2666, Invalid=14104, Unknown=0, NotChecked=0, Total=16770 [2024-11-18 09:32:10,609 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 2771 mSDsluCounter, 6158 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2771 SdHoareTripleChecker+Valid, 6491 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:10,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2771 Valid, 6491 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-18 09:32:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-18 09:32:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 883. [2024-11-18 09:32:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.409297052154195) internal successors, (1243), 882 states have internal predecessors, (1243), 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-18 09:32:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1243 transitions. [2024-11-18 09:32:10,666 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1243 transitions. Word has length 70 [2024-11-18 09:32:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:10,666 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1243 transitions. [2024-11-18 09:32:10,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 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-18 09:32:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1243 transitions. [2024-11-18 09:32:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 09:32:10,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:10,668 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:10,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-18 09:32:10,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:10,870 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:10,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2024-11-18 09:32:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228970974] [2024-11-18 09:32:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:10,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:10,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:10,877 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:32:10,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-18 09:32:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:10,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:32:10,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-18 09:32:10,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:10,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228970974] [2024-11-18 09:32:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228970974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 09:32:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773901512] [2024-11-18 09:32:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 09:32:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 09:32:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:32:10,994 INFO L87 Difference]: Start difference. First operand 883 states and 1243 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-18 09:32:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:11,174 INFO L93 Difference]: Finished difference Result 1200 states and 1684 transitions. [2024-11-18 09:32:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:32:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 70 [2024-11-18 09:32:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:11,177 INFO L225 Difference]: With dead ends: 1200 [2024-11-18 09:32:11,177 INFO L226 Difference]: Without dead ends: 1040 [2024-11-18 09:32:11,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:32:11,178 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 118 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:11,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 375 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-11-18 09:32:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 730. [2024-11-18 09:32:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.412894375857339) internal successors, (1030), 729 states have internal predecessors, (1030), 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-18 09:32:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1030 transitions. [2024-11-18 09:32:11,216 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1030 transitions. Word has length 70 [2024-11-18 09:32:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:11,216 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1030 transitions. [2024-11-18 09:32:11,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-18 09:32:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1030 transitions. [2024-11-18 09:32:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-18 09:32:11,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:11,220 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:11,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-18 09:32:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:11,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:11,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2024-11-18 09:32:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:11,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423518937] [2024-11-18 09:32:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:11,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:11,427 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:32:11,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-18 09:32:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:11,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 09:32:11,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:32:11,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:32:11,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423518937] [2024-11-18 09:32:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423518937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:11,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 09:32:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362734031] [2024-11-18 09:32:11,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:32:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:32:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:32:11,634 INFO L87 Difference]: Start difference. First operand 730 states and 1030 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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-18 09:32:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:12,120 INFO L93 Difference]: Finished difference Result 2592 states and 3686 transitions. [2024-11-18 09:32:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 09:32:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 72 [2024-11-18 09:32:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:12,125 INFO L225 Difference]: With dead ends: 2592 [2024-11-18 09:32:12,125 INFO L226 Difference]: Without dead ends: 1879 [2024-11-18 09:32:12,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:32:12,127 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:12,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 139 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 09:32:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-18 09:32:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1522. [2024-11-18 09:32:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.428007889546351) internal successors, (2172), 1521 states have internal predecessors, (2172), 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-18 09:32:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2172 transitions. [2024-11-18 09:32:12,224 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2172 transitions. Word has length 72 [2024-11-18 09:32:12,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2172 transitions. [2024-11-18 09:32:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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-18 09:32:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2172 transitions. [2024-11-18 09:32:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-18 09:32:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:12,226 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:12,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:12,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:12,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:12,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2024-11-18 09:32:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869617350] [2024-11-18 09:32:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:32:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:12,435 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 09:32:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-18 09:32:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:12,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-18 09:32:12,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:14,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:17,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869617350] [2024-11-18 09:32:17,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869617350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:17,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:17,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-18 09:32:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374705574] [2024-11-18 09:32:17,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-18 09:32:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-18 09:32:17,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-18 09:32:17,260 INFO L87 Difference]: Start difference. First operand 1522 states and 2172 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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)