./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-regression/recHanoi03-1.c -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 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:15:17,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:15:17,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:15:17,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:15:17,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:15:17,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:15:17,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:15:17,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:15:17,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:15:17,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:15:17,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:15:17,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:15:17,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:15:17,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:15:17,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:15:17,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:15:17,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:15:17,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:15:17,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:15:17,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:15:17,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:15:17,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:15:17,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:15:17,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:15:17,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:15:17,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:15:17,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:15:17,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:15:17,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:15:17,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:15:17,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:15:17,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:15:17,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:17,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:15:17,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:15:17,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:15:17,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:15:17,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:15:17,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:15:17,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:15:17,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:15:17,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:15:17,221 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 -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2024-11-21 21:15:17,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:15:17,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:15:17,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:15:17,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:15:17,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:15:17,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-21 21:15:18,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:15:19,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:15:19,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-21 21:15:19,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff605dbaf/41a06d665a52431c9f0b873252254431/FLAG88457f61c [2024-11-21 21:15:19,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff605dbaf/41a06d665a52431c9f0b873252254431 [2024-11-21 21:15:19,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:15:19,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:15:19,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:19,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:15:19,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:15:19,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bbc05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:15:19,350 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-regression/recHanoi03-1.c[838,851] [2024-11-21 21:15:19,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:19,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:15:19,386 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-regression/recHanoi03-1.c[838,851] [2024-11-21 21:15:19,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:19,404 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:15:19,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19 WrapperNode [2024-11-21 21:15:19,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:19,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:19,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:15:19,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:15:19,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,437 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-21 21:15:19,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:19,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:15:19,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:15:19,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:15:19,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,467 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-21 21:15:19,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:15:19,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:15:19,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:15:19,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:15:19,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:19,523 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-21 21:15:19,530 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-21 21:15:19,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:15:19,577 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-21 21:15:19,577 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-21 21:15:19,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:15:19,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:15:19,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:15:19,635 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:15:19,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:15:19,788 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-21 21:15:19,788 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:15:19,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:15:19,802 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-21 21:15:19,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19 BoogieIcfgContainer [2024-11-21 21:15:19,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:15:19,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:15:19,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:15:19,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:15:19,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:15:19" (1/3) ... [2024-11-21 21:15:19,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228b5599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (2/3) ... [2024-11-21 21:15:19,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228b5599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19" (3/3) ... [2024-11-21 21:15:19,816 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-21 21:15:19,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:15:19,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:15:19,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:15:19,912 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;@474358ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:15:19,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:15:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:15:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-21 21:15:19,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:19,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:19,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 176773050, now seen corresponding path program 1 times [2024-11-21 21:15:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:19,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037213931] [2024-11-21 21:15:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:20,302 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-21 21:15:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037213931] [2024-11-21 21:15:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037213931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 21:15:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948943972] [2024-11-21 21:15:20,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:15:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:15:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:15:20,345 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:20,429 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-21 21:15:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:15:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-21 21:15:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:20,444 INFO L225 Difference]: With dead ends: 31 [2024-11-21 21:15:20,444 INFO L226 Difference]: Without dead ends: 22 [2024-11-21 21:15:20,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:15:20,453 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:20,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-21 21:15:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-21 21:15:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-21 21:15:20,505 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2024-11-21 21:15:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:20,505 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-21 21:15:20,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-21 21:15:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 21:15:20,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:20,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:20,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:15:20,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:20,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1929421739, now seen corresponding path program 1 times [2024-11-21 21:15:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:20,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230952480] [2024-11-21 21:15:20,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:20,600 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-21 21:15:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230952480] [2024-11-21 21:15:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230952480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:20,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:15:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876722836] [2024-11-21 21:15:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:20,607 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:20,621 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-21 21:15:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:20,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-21 21:15:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:20,623 INFO L225 Difference]: With dead ends: 29 [2024-11-21 21:15:20,623 INFO L226 Difference]: Without dead ends: 25 [2024-11-21 21:15:20,623 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-21 21:15:20,624 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 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-21 21:15:20,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-21 21:15:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-21 21:15:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-21 21:15:20,637 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2024-11-21 21:15:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:20,637 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-21 21:15:20,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-21 21:15:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 21:15:20,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:20,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:15:20,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:20,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 319247983, now seen corresponding path program 1 times [2024-11-21 21:15:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356024894] [2024-11-21 21:15:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:20,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 21:15:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:20,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 21:15:20,712 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 21:15:20,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:15:20,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:15:20,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 21:15:20,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:15:20,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:15:20 BoogieIcfgContainer [2024-11-21 21:15:20,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:15:20,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:15:20,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:15:20,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:15:20,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19" (3/4) ... [2024-11-21 21:15:20,753 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 21:15:20,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:15:20,755 INFO L158 Benchmark]: Toolchain (without parser) took 1616.24ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 120.6MB in the beginning and 186.7MB in the end (delta: -66.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:20,755 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:20,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.06ms. Allocated memory is still 176.2MB. Free memory was 120.6MB in the beginning and 108.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:15:20,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.80ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:20,758 INFO L158 Benchmark]: Boogie Preprocessor took 41.07ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 105.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:20,759 INFO L158 Benchmark]: RCFGBuilder took 322.20ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 94.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 21:15:20,759 INFO L158 Benchmark]: TraceAbstraction took 941.27ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 94.3MB in the beginning and 186.7MB in the end (delta: -92.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:20,759 INFO L158 Benchmark]: Witness Printer took 5.55ms. Allocated memory is still 230.7MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:20,761 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.19ms. Allocated memory is still 176.2MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.06ms. Allocated memory is still 176.2MB. Free memory was 120.6MB in the beginning and 108.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.80ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.07ms. Allocated memory is still 176.2MB. Free memory was 106.9MB in the beginning and 105.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.20ms. Allocated memory is still 176.2MB. Free memory was 105.3MB in the beginning and 94.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 941.27ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 94.3MB in the beginning and 186.7MB in the end (delta: -92.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.55ms. Allocated memory is still 230.7MB. Free memory is still 186.7MB. 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: 36]: 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 shiftLeft at line 33. Possible FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=1] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L31] RET, EXPR hanoi(n) VAL [n=1] [L31] unsigned result = hanoi(n); [L33] result+1>0 && result+1 == 1<0 && result+1 == 1<0 && result+1 == 1< 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 -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2024-11-21 21:15:23,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:15:23,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:15:23,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:15:23,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:15:23,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:15:23,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-21 21:15:25,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:15:25,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:15:25,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-21 21:15:25,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948e90034/ecb865a134c44d9596fc8f5ea00f03c7/FLAGe2410f986 [2024-11-21 21:15:25,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948e90034/ecb865a134c44d9596fc8f5ea00f03c7 [2024-11-21 21:15:25,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:15:25,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:15:25,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:25,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:15:25,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:15:25,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7efc6428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25, skipping insertion in model container [2024-11-21 21:15:25,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:15:25,535 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-regression/recHanoi03-1.c[838,851] [2024-11-21 21:15:25,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:25,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:15:25,570 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-regression/recHanoi03-1.c[838,851] [2024-11-21 21:15:25,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:25,589 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:15:25,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25 WrapperNode [2024-11-21 21:15:25,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:25,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:25,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:15:25,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:15:25,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,620 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-11-21 21:15:25,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:25,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:15:25,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:15:25,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:15:25,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,646 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-21 21:15:25,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:15:25,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:15:25,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:15:25,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:15:25,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (1/1) ... [2024-11-21 21:15:25,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:25,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:25,704 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-21 21:15:25,711 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-21 21:15:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:15:25,764 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-21 21:15:25,765 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-21 21:15:25,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:15:25,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:15:25,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 21:15:25,836 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:15:25,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:15:25,970 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-21 21:15:25,970 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:15:25,983 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:15:25,983 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-21 21:15:25,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:25 BoogieIcfgContainer [2024-11-21 21:15:25,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:15:25,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:15:25,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:15:25,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:15:25,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:15:25" (1/3) ... [2024-11-21 21:15:25,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e9deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:25, skipping insertion in model container [2024-11-21 21:15:25,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:25" (2/3) ... [2024-11-21 21:15:25,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e9deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:25, skipping insertion in model container [2024-11-21 21:15:25,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:25" (3/3) ... [2024-11-21 21:15:25,996 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-21 21:15:26,014 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:15:26,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:15:26,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:15:26,092 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;@2b18cafe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:15:26,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:15:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 21:15:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-21 21:15:26,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:26,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:26,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2024-11-21 21:15:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:26,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856240595] [2024-11-21 21:15:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:26,131 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-21 21:15:26,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:26,134 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-21 21:15:26,136 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-21 21:15:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:26,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 21:15:26,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:26,438 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-21 21:15:26,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:26,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856240595] [2024-11-21 21:15:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856240595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:26,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 21:15:26,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001174564] [2024-11-21 21:15:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 21:15:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 21:15:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:15:26,475 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:26,590 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-21 21:15:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 21:15:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-21 21:15:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:26,602 INFO L225 Difference]: With dead ends: 26 [2024-11-21 21:15:26,602 INFO L226 Difference]: Without dead ends: 16 [2024-11-21 21:15:26,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:15:26,611 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:26,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-21 21:15:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-21 21:15:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:15:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-21 21:15:26,663 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-21 21:15:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-21 21:15:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 21:15:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-21 21:15:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 21:15:26,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:26,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:26,670 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 (2)] Ended with exit code 0 [2024-11-21 21:15:26,869 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-21 21:15:26,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:26,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2024-11-21 21:15:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001816821] [2024-11-21 21:15:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:26,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-21 21:15:26,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:26,875 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-21 21:15:26,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 (3)] Waiting until timeout for monitored process [2024-11-21 21:15:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:26,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-21 21:15:26,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-21 21:15:27,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 21:15:27,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001816821] [2024-11-21 21:15:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001816821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:27,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-21 21:15:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741179069] [2024-11-21 21:15:27,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:27,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-21 21:15:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:27,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-21 21:15:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-21 21:15:27,687 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-21 21:15:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:27,981 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-21 21:15:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-21 21:15:27,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-11-21 21:15:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:27,983 INFO L225 Difference]: With dead ends: 28 [2024-11-21 21:15:27,983 INFO L226 Difference]: Without dead ends: 22 [2024-11-21 21:15:27,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-21 21:15:27,985 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:27,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-21 21:15:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-21 21:15:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 21:15:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-21 21:15:27,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2024-11-21 21:15:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-21 21:15:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-21 21:15:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-21 21:15:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 21:15:27,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:27,994 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:28,000 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 (3)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:28,198 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-21 21:15:28,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:28,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2024-11-21 21:15:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444227046] [2024-11-21 21:15:28,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:28,202 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-21 21:15:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:28,204 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-21 21:15:28,205 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-21 21:15:28,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:28,237 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:28,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-21 21:15:28,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:15:28,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:15:29,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444227046] [2024-11-21 21:15:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444227046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:29,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-11-21 21:15:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601149134] [2024-11-21 21:15:29,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:29,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-21 21:15:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:29,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-21 21:15:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-21 21:15:29,642 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-21 21:15:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:30,217 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-21 21:15:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-21 21:15:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 29 [2024-11-21 21:15:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:30,219 INFO L225 Difference]: With dead ends: 34 [2024-11-21 21:15:30,219 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 21:15:30,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-11-21 21:15:30,221 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:30,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 122 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:15:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 21:15:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-21 21:15:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 21:15:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-21 21:15:30,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2024-11-21 21:15:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:30,234 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-21 21:15:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-21 21:15:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-21 21:15:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-21 21:15:30,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:30,236 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:30,239 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 (4)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:30,436 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-21 21:15:30,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:30,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2024-11-21 21:15:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852743414] [2024-11-21 21:15:30,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 21:15:30,439 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-21 21:15:30,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:30,442 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-21 21:15:30,443 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-21 21:15:30,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-21 21:15:30,483 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:30,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-21 21:15:30,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-21 21:15:30,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:15:32,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852743414] [2024-11-21 21:15:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852743414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:32,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:32,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-11-21 21:15:32,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696755651] [2024-11-21 21:15:32,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:32,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-21 21:15:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:32,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-21 21:15:32,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-11-21 21:15:32,734 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-21 21:15:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:33,476 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-21 21:15:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-21 21:15:33,477 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2024-11-21 21:15:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:33,479 INFO L225 Difference]: With dead ends: 40 [2024-11-21 21:15:33,479 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 21:15:33,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2024-11-21 21:15:33,482 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:33,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 180 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:15:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 21:15:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-21 21:15:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-21 21:15:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-21 21:15:33,491 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2024-11-21 21:15:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:33,491 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-21 21:15:33,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-21 21:15:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-21 21:15:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-21 21:15:33,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:33,494 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:33,498 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-21 21:15:33,696 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-21 21:15:33,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:33,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2024-11-21 21:15:33,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:33,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195993887] [2024-11-21 21:15:33,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 21:15:33,698 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-21 21:15:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:33,702 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-21 21:15:33,703 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-21 21:15:33,738 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 21:15:33,739 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:33,742 WARN L253 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-21 21:15:33,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-21 21:15:34,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-21 21:15:36,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195993887] [2024-11-21 21:15:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195993887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:36,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2024-11-21 21:15:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632660098] [2024-11-21 21:15:36,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:36,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-21 21:15:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:36,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-21 21:15:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2024-11-21 21:15:36,753 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-21 21:15:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:37,741 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-21 21:15:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-21 21:15:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2024-11-21 21:15:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:37,743 INFO L225 Difference]: With dead ends: 46 [2024-11-21 21:15:37,743 INFO L226 Difference]: Without dead ends: 40 [2024-11-21 21:15:37,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2024-11-21 21:15:37,748 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:37,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 326 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:15:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-21 21:15:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-21 21:15:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-21 21:15:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-21 21:15:37,767 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2024-11-21 21:15:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:37,767 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-21 21:15:37,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-21 21:15:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-21 21:15:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-21 21:15:37,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:37,772 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:37,776 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 (6)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:37,973 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-21 21:15:37,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:37,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2024-11-21 21:15:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:37,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104428671] [2024-11-21 21:15:37,974 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 21:15:37,974 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-21 21:15:37,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:37,976 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-21 21:15:37,977 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-21 21:15:38,028 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-21 21:15:38,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:38,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-21 21:15:38,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-21 21:15:38,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-21 21:15:41,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:41,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104428671] [2024-11-21 21:15:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104428671] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:41,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2024-11-21 21:15:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088717421] [2024-11-21 21:15:41,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-21 21:15:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-21 21:15:41,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-21 21:15:41,720 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-21 21:15:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:43,352 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-21 21:15:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-21 21:15:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 65 [2024-11-21 21:15:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:43,354 INFO L225 Difference]: With dead ends: 52 [2024-11-21 21:15:43,354 INFO L226 Difference]: Without dead ends: 46 [2024-11-21 21:15:43,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=537, Invalid=5469, Unknown=0, NotChecked=0, Total=6006 [2024-11-21 21:15:43,356 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 106 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:43,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 438 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:15:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-21 21:15:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-21 21:15:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-21 21:15:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-21 21:15:43,364 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2024-11-21 21:15:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-21 21:15:43,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-21 21:15:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-21 21:15:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-21 21:15:43,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:43,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:43,373 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 (7)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:43,567 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-21 21:15:43,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:43,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2024-11-21 21:15:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:43,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809682013] [2024-11-21 21:15:43,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 21:15:43,569 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-21 21:15:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:43,572 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-21 21:15:43,573 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-21 21:15:43,655 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-21 21:15:43,656 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:43,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-21 21:15:43,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-21 21:15:44,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-21 21:15:48,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:48,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809682013] [2024-11-21 21:15:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809682013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:48,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2024-11-21 21:15:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277270625] [2024-11-21 21:15:48,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:48,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-21 21:15:48,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-21 21:15:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2024-11-21 21:15:48,496 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-21 21:15:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:50,439 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-11-21 21:15:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-21 21:15:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 77 [2024-11-21 21:15:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:50,441 INFO L225 Difference]: With dead ends: 58 [2024-11-21 21:15:50,441 INFO L226 Difference]: Without dead ends: 52 [2024-11-21 21:15:50,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=691, Invalid=7681, Unknown=0, NotChecked=0, Total=8372 [2024-11-21 21:15:50,444 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 318 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:50,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 586 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 21:15:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-21 21:15:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-21 21:15:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-21 21:15:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-21 21:15:50,456 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2024-11-21 21:15:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:50,456 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-21 21:15:50,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-21 21:15:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-21 21:15:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-21 21:15:50,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:50,458 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:50,462 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 (8)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:50,658 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-21 21:15:50,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2024-11-21 21:15:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866191345] [2024-11-21 21:15:50,660 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 21:15:50,660 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-21 21:15:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:50,663 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-21 21:15:50,664 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-21 21:15:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:50,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-21 21:15:50,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-21 21:15:51,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-21 21:15:56,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866191345] [2024-11-21 21:15:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866191345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:56,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2024-11-21 21:15:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927127751] [2024-11-21 21:15:56,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-21 21:15:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-21 21:15:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2024-11-21 21:15:56,941 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-21 21:15:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:59,148 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-11-21 21:15:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-21 21:15:59,149 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 89 [2024-11-21 21:15:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:59,150 INFO L225 Difference]: With dead ends: 64 [2024-11-21 21:15:59,150 INFO L226 Difference]: Without dead ends: 58 [2024-11-21 21:15:59,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=861, Invalid=10269, Unknown=0, NotChecked=0, Total=11130 [2024-11-21 21:15:59,154 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 172 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:59,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 732 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 21:15:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-21 21:15:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-21 21:15:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-21 21:15:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-21 21:15:59,162 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2024-11-21 21:15:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:59,163 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-21 21:15:59,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-11-21 21:15:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-21 21:15:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-21 21:15:59,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:59,165 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:59,170 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-21 21:15:59,365 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-21 21:15:59,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2024-11-21 21:15:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811965552] [2024-11-21 21:15:59,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:59,367 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-21 21:15:59,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:59,368 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-21 21:15:59,369 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-21 21:15:59,446 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:59,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:59,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-21 21:15:59,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:16:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-21 21:16:00,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:16:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-21 21:16:07,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:16:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811965552] [2024-11-21 21:16:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811965552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:16:07,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:16:07,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2024-11-21 21:16:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964345358] [2024-11-21 21:16:07,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:16:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-21 21:16:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:16:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-21 21:16:07,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2024-11-21 21:16:07,196 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-21 21:16:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:10,094 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2024-11-21 21:16:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-21 21:16:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 101 [2024-11-21 21:16:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:10,096 INFO L225 Difference]: With dead ends: 70 [2024-11-21 21:16:10,096 INFO L226 Difference]: Without dead ends: 64 [2024-11-21 21:16:10,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1047, Invalid=13233, Unknown=0, NotChecked=0, Total=14280 [2024-11-21 21:16:10,100 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 358 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:10,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 919 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-21 21:16:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-21 21:16:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-21 21:16:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-21 21:16:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-21 21:16:10,110 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2024-11-21 21:16:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-21 21:16:10,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-21 21:16:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-21 21:16:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-21 21:16:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:10,113 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:10,117 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 (10)] Forceful destruction successful, exit code 0 [2024-11-21 21:16:10,313 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-21 21:16:10,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2024-11-21 21:16:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:16:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682135331] [2024-11-21 21:16:10,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 21:16:10,315 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-21 21:16:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:16:10,316 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-21 21:16:10,317 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-21 21:16:10,418 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-21 21:16:10,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:16:10,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-21 21:16:10,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:16:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-21 21:16:11,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:16:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-21 21:16:20,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:16:20,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682135331] [2024-11-21 21:16:20,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682135331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:16:20,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:16:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2024-11-21 21:16:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075769476] [2024-11-21 21:16:20,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:16:20,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-21 21:16:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:16:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-21 21:16:20,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2024-11-21 21:16:20,164 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-21 21:16:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:23,433 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-21 21:16:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-21 21:16:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 113 [2024-11-21 21:16:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:23,434 INFO L225 Difference]: With dead ends: 76 [2024-11-21 21:16:23,435 INFO L226 Difference]: Without dead ends: 70 [2024-11-21 21:16:23,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1249, Invalid=16573, Unknown=0, NotChecked=0, Total=17822 [2024-11-21 21:16:23,437 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 402 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:23,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1122 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-21 21:16:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-21 21:16:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-21 21:16:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-21 21:16:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-21 21:16:23,449 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2024-11-21 21:16:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:23,449 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-21 21:16:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-21 21:16:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-21 21:16:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 21:16:23,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:23,451 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:23,456 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-21 21:16:23,651 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-21 21:16:23,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:23,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2024-11-21 21:16:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:16:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824125009] [2024-11-21 21:16:23,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 21:16:23,653 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-21 21:16:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:16:23,655 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-21 21:16:23,656 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-21 21:16:23,743 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 21:16:23,743 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:16:23,745 WARN L253 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-21 21:16:23,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:16:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-21 21:16:24,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:16:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-21 21:16:35,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:16:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824125009] [2024-11-21 21:16:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824125009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:16:35,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:16:35,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2024-11-21 21:16:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938588823] [2024-11-21 21:16:35,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:16:35,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-11-21 21:16:35,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:16:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-11-21 21:16:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2024-11-21 21:16:35,319 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-21 21:16:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:16:39,412 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-21 21:16:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-21 21:16:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 125 [2024-11-21 21:16:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:16:39,414 INFO L225 Difference]: With dead ends: 82 [2024-11-21 21:16:39,414 INFO L226 Difference]: Without dead ends: 76 [2024-11-21 21:16:39,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1467, Invalid=20289, Unknown=0, NotChecked=0, Total=21756 [2024-11-21 21:16:39,418 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 806 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:16:39,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1450 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-21 21:16:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-21 21:16:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-21 21:16:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-21 21:16:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2024-11-21 21:16:39,434 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2024-11-21 21:16:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:16:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-21 21:16:39,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-11-21 21:16:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2024-11-21 21:16:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-21 21:16:39,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:16:39,438 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:16:39,450 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 (12)] Forceful destruction successful, exit code 0 [2024-11-21 21:16:39,638 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-21 21:16:39,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:16:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:16:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2024-11-21 21:16:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:16:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938367404] [2024-11-21 21:16:39,640 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 21:16:39,640 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-21 21:16:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:16:39,641 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-21 21:16:39,642 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-21 21:16:39,778 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-21 21:16:39,778 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:16:39,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-21 21:16:39,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:16:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-21 21:16:40,978 INFO L311 TraceCheckSpWp]: Computing backward predicates...