./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:01:22,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:01:22,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:01:22,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:01:22,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:01:22,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:01:22,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:01:22,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:01:22,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:01:22,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:01:22,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:01:22,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:01:22,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:01:22,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:01:22,831 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:01:22,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:01:22,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:01:22,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:01:22,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:01:22,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:01:22,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:01:22,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:01:22,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:01:22,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:01:22,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:01:22,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:01:22,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:01:22,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:01:22,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:01:22,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:01:22,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:01:22,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:01:22,840 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-11 16:01:23,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:01:23,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:01:23,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:01:23,062 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:01:23,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:01:23,063 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-11 16:01:24,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:01:24,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:01:24,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-11 16:01:24,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877618af0/898798936a444a17914342b11463f9f5/FLAG41f0f0539 [2024-11-11 16:01:24,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877618af0/898798936a444a17914342b11463f9f5 [2024-11-11 16:01:24,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:01:24,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:01:24,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:24,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:01:24,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:01:24,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:24" (1/1) ... [2024-11-11 16:01:24,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e2f668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:24, skipping insertion in model container [2024-11-11 16:01:24,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:24" (1/1) ... [2024-11-11 16:01:24,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:01:25,052 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-11 16:01:25,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:25,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:01:25,100 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-11 16:01:25,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:25,125 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:01:25,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25 WrapperNode [2024-11-11 16:01:25,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:25,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:25,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:01:25,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:01:25,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,208 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-11 16:01:25,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:25,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:01:25,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:01:25,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:01:25,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,244 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-11 16:01:25,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:01:25,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:01:25,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:01:25,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:01:25,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (1/1) ... [2024-11-11 16:01:25,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:01:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:25,309 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-11 16:01:25,312 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-11 16:01:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:01:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-11 16:01:25,369 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-11 16:01:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:01:25,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:01:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:01:25,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:01:25,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:01:25,555 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-11 16:01:25,556 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:01:25,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:01:25,569 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 16:01:25,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:25 BoogieIcfgContainer [2024-11-11 16:01:25,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:01:25,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:01:25,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:01:25,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:01:25,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:01:24" (1/3) ... [2024-11-11 16:01:25,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dd506d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:25, skipping insertion in model container [2024-11-11 16:01:25,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:25" (2/3) ... [2024-11-11 16:01:25,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77dd506d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:25, skipping insertion in model container [2024-11-11 16:01:25,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:25" (3/3) ... [2024-11-11 16:01:25,580 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-11 16:01:25,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:01:25,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:01:25,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:01:25,661 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;@5207921c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:01:25,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:01:25,666 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-11 16:01:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 16:01:25,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:25,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:25,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:25,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:25,679 INFO L85 PathProgramCache]: Analyzing trace with hash 176773050, now seen corresponding path program 1 times [2024-11-11 16:01:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923439080] [2024-11-11 16:01:25,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 16:01:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:25,945 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-11 16:01:25,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923439080] [2024-11-11 16:01:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923439080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 16:01:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941532295] [2024-11-11 16:01:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:25,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:01:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:25,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:01:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:01:25,983 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-11 16:01:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:26,029 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-11 16:01:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:01:26,031 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-11 16:01:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:26,037 INFO L225 Difference]: With dead ends: 31 [2024-11-11 16:01:26,038 INFO L226 Difference]: Without dead ends: 22 [2024-11-11 16:01:26,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11 16:01:26,043 INFO L435 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:26,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-11 16:01:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-11 16:01:26,073 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-11 16:01:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-11 16:01:26,075 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2024-11-11 16:01:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-11 16:01:26,076 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-11 16:01:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-11-11 16:01:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 16:01:26,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:26,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:26,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:01:26,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:26,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1929421739, now seen corresponding path program 1 times [2024-11-11 16:01:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:26,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588472603] [2024-11-11 16:01:26,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 16:01:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:26,126 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-11 16:01:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588472603] [2024-11-11 16:01:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588472603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:01:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460686331] [2024-11-11 16:01:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:26,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:01:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:01:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:01:26,130 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-11 16:01:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:26,136 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-11 16:01:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:01:26,137 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-11 16:01:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:26,137 INFO L225 Difference]: With dead ends: 29 [2024-11-11 16:01:26,138 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 16:01:26,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 16:01:26,139 INFO L435 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-11 16:01:26,139 INFO L436 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-11 16:01:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 16:01:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-11 16:01:26,144 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-11 16:01:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-11 16:01:26,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2024-11-11 16:01:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-11 16:01:26,145 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-11 16:01:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-11 16:01:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 16:01:26,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:26,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:26,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:01:26,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash 319247983, now seen corresponding path program 1 times [2024-11-11 16:01:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:26,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075868128] [2024-11-11 16:01:26,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:01:26,160 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 16:01:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:01:26,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 16:01:26,182 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 16:01:26,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:01:26,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:01:26,187 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-11 16:01:26,204 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:01:26,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:01:26 BoogieIcfgContainer [2024-11-11 16:01:26,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:01:26,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:01:26,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:01:26,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:01:26,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:25" (3/4) ... [2024-11-11 16:01:26,211 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 16:01:26,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:01:26,213 INFO L158 Benchmark]: Toolchain (without parser) took 1483.21ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 94.5MB in the beginning and 172.8MB in the end (delta: -78.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-11 16:01:26,213 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:01:26,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.16ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 82.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 16:01:26,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.11ms. Allocated memory is still 167.8MB. Free memory was 82.2MB in the beginning and 137.8MB in the end (delta: -55.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-11 16:01:26,214 INFO L158 Benchmark]: Boogie Preprocessor took 47.07ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 136.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:01:26,215 INFO L158 Benchmark]: RCFGBuilder took 309.37ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 136.2MB in the beginning and 214.8MB in the end (delta: -78.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-11 16:01:26,215 INFO L158 Benchmark]: TraceAbstraction took 634.45ms. Allocated memory is still 251.7MB. Free memory was 213.7MB in the beginning and 173.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-11 16:01:26,215 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 251.7MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:01:26,217 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.14ms. Allocated memory is still 167.8MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.16ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 82.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.11ms. Allocated memory is still 167.8MB. Free memory was 82.2MB in the beginning and 137.8MB in the end (delta: -55.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.07ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 136.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.37ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 136.2MB in the beginning and 214.8MB in the end (delta: -78.6MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * TraceAbstraction took 634.45ms. Allocated memory is still 251.7MB. Free memory was 213.7MB in the beginning and 173.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 251.7MB. Free memory is still 172.8MB. 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-11 16:01:28,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:01:28,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:01:28,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:01:28,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:01:28,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:01:28,718 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-11 16:01:30,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:01:30,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:01:30,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-11 16:01:30,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48bfe047/9a60745fa52f4c58a2a07145e68d1382/FLAG02b95e37f [2024-11-11 16:01:30,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48bfe047/9a60745fa52f4c58a2a07145e68d1382 [2024-11-11 16:01:30,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:01:30,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:01:30,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:30,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:01:30,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:01:30,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebf8ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30, skipping insertion in model container [2024-11-11 16:01:30,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:01:30,764 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-11 16:01:30,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:30,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:01:30,787 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-11 16:01:30,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:30,800 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:01:30,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30 WrapperNode [2024-11-11 16:01:30,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:30,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:30,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:01:30,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:01:30,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,822 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-11-11 16:01:30,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:30,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:01:30,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:01:30,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:01:30,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,839 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-11 16:01:30,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:01:30,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:01:30,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:01:30,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:01:30,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (1/1) ... [2024-11-11 16:01:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:01:30,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:30,872 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-11 16:01:30,875 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-11 16:01:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:01:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-11 16:01:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-11 16:01:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:01:30,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:01:30,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 16:01:30,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:01:30,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:01:31,077 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-11 16:01:31,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:01:31,087 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:01:31,087 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 16:01:31,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:31 BoogieIcfgContainer [2024-11-11 16:01:31,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:01:31,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:01:31,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:01:31,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:01:31,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:01:30" (1/3) ... [2024-11-11 16:01:31,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72999813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:31, skipping insertion in model container [2024-11-11 16:01:31,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:30" (2/3) ... [2024-11-11 16:01:31,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72999813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:31, skipping insertion in model container [2024-11-11 16:01:31,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:31" (3/3) ... [2024-11-11 16:01:31,096 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-11 16:01:31,108 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:01:31,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:01:31,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:01:31,159 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;@12c9fa3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:01:31,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:01:31,164 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-11 16:01:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 16:01:31,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:31,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:31,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2024-11-11 16:01:31,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:31,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128204594] [2024-11-11 16:01:31,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:31,185 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-11 16:01:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:31,187 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-11 16:01:31,188 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-11 16:01:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:31,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:31,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:31,398 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-11 16:01:31,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:31,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128204594] [2024-11-11 16:01:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128204594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 16:01:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131979425] [2024-11-11 16:01:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:01:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:01:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:31,427 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-11 16:01:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:31,533 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-11-11 16:01:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:01:31,536 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-11 16:01:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:31,542 INFO L225 Difference]: With dead ends: 26 [2024-11-11 16:01:31,542 INFO L226 Difference]: Without dead ends: 16 [2024-11-11 16:01:31,545 INFO L434 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-11 16:01:31,548 INFO L435 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-11 16:01:31,550 INFO L436 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-11 16:01:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-11 16:01:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-11 16:01:31,578 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-11 16:01:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-11 16:01:31,580 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-11 16:01:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:31,581 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-11 16:01:31,581 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-11 16:01:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-11 16:01:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 16:01:31,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:31,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:31,586 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-11 16:01:31,783 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-11 16:01:31,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:31,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2024-11-11 16:01:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240789736] [2024-11-11 16:01:31,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:31,785 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-11 16:01:31,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:31,787 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-11 16:01:31,788 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-11 16:01:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:31,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 16:01:31,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:31,978 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-11 16:01:31,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:32,467 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-11 16:01:32,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240789736] [2024-11-11 16:01:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240789736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:32,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-11 16:01:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560216466] [2024-11-11 16:01:32,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:32,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 16:01:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 16:01:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:32,475 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-11 16:01:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:32,794 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-11 16:01:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 16:01:32,795 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-11 16:01:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:32,796 INFO L225 Difference]: With dead ends: 28 [2024-11-11 16:01:32,796 INFO L226 Difference]: Without dead ends: 22 [2024-11-11 16:01:32,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-11 16:01:32,797 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:32,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:01:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-11 16:01:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-11 16:01:32,801 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-11 16:01:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-11 16:01:32,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2024-11-11 16:01:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-11 16:01:32,803 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-11 16:01:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-11 16:01:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 16:01:32,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:32,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:32,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 16:01:33,006 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-11 16:01:33,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2024-11-11 16:01:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083724680] [2024-11-11 16:01:33,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:33,008 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-11 16:01:33,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:33,010 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-11 16:01:33,011 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-11 16:01:33,040 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:01:33,040 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:33,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 16:01:33,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:33,232 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-11 16:01:33,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:34,099 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-11 16:01:34,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:34,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083724680] [2024-11-11 16:01:34,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083724680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:34,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-11-11 16:01:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330172170] [2024-11-11 16:01:34,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 16:01:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 16:01:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-11 16:01:34,102 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-11 16:01:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:34,497 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-11 16:01:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 16:01:34,498 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-11 16:01:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:34,499 INFO L225 Difference]: With dead ends: 34 [2024-11-11 16:01:34,499 INFO L226 Difference]: Without dead ends: 28 [2024-11-11 16:01:34,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:01:34,500 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 122 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:01:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-11 16:01:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-11 16:01:34,504 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-11 16:01:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-11 16:01:34,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2024-11-11 16:01:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:34,505 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-11 16:01:34,506 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-11 16:01:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-11 16:01:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 16:01:34,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:34,506 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:34,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-11 16:01:34,708 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-11 16:01:34,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:34,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2024-11-11 16:01:34,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:34,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493427506] [2024-11-11 16:01:34,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 16:01:34,713 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-11 16:01:34,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:34,715 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-11 16:01:34,716 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-11 16:01:34,740 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-11 16:01:34,740 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 16:01:34,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:34,970 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-11 16:01:34,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:36,562 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-11 16:01:36,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493427506] [2024-11-11 16:01:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493427506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:36,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:36,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-11-11 16:01:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733934112] [2024-11-11 16:01:36,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:36,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-11 16:01:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:36,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-11 16:01:36,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:01:36,572 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-11 16:01:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:37,366 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-11 16:01:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 16:01:37,369 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-11 16:01:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:37,373 INFO L225 Difference]: With dead ends: 40 [2024-11-11 16:01:37,374 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 16:01:37,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 16:01:37,377 INFO L435 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-11 16:01:37,382 INFO L436 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-11 16:01:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 16:01:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-11 16:01:37,388 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-11 16:01:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-11 16:01:37,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2024-11-11 16:01:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:37,389 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-11 16:01:37,390 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-11 16:01:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-11 16:01:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 16:01:37,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:37,393 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:37,401 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 (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:37,595 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-11 16:01:37,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2024-11-11 16:01:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561489376] [2024-11-11 16:01:37,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 16:01:37,598 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-11 16:01:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:37,601 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-11 16:01:37,603 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-11 16:01:37,635 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 16:01:37,635 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:37,640 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-11 16:01:37,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:37,970 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-11 16:01:37,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:40,126 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-11 16:01:40,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561489376] [2024-11-11 16:01:40,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561489376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:40,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:40,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2024-11-11 16:01:40,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836379214] [2024-11-11 16:01:40,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-11 16:01:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-11 16:01:40,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 16:01:40,129 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-11 16:01:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:41,131 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-11 16:01:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 16:01:41,132 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-11 16:01:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:41,135 INFO L225 Difference]: With dead ends: 46 [2024-11-11 16:01:41,135 INFO L226 Difference]: Without dead ends: 40 [2024-11-11 16:01:41,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2024-11-11 16:01:41,137 INFO L435 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-11 16:01:41,137 INFO L436 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-11 16:01:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-11 16:01:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-11 16:01:41,152 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-11 16:01:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-11 16:01:41,153 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2024-11-11 16:01:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:41,153 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-11 16:01:41,153 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-11 16:01:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-11 16:01:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 16:01:41,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:41,154 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:41,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-11 16:01:41,354 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-11 16:01:41,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:41,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2024-11-11 16:01:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947343392] [2024-11-11 16:01:41,356 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 16:01:41,356 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-11 16:01:41,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:41,359 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-11 16:01:41,360 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-11 16:01:41,435 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-11 16:01:41,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:41,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-11 16:01:41,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:41,880 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-11 16:01:41,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:44,910 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-11 16:01:44,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947343392] [2024-11-11 16:01:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947343392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:44,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2024-11-11 16:01:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386785989] [2024-11-11 16:01:44,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-11 16:01:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-11 16:01:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-11 16:01:44,913 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-11 16:01:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:46,164 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-11 16:01:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 16:01:46,165 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-11 16:01:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:46,166 INFO L225 Difference]: With dead ends: 52 [2024-11-11 16:01:46,166 INFO L226 Difference]: Without dead ends: 46 [2024-11-11 16:01:46,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=537, Invalid=5469, Unknown=0, NotChecked=0, Total=6006 [2024-11-11 16:01:46,171 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 106 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:46,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 438 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:01:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-11 16:01:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-11 16:01:46,178 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-11 16:01:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-11 16:01:46,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2024-11-11 16:01:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:46,183 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-11 16:01:46,183 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-11 16:01:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-11 16:01:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 16:01:46,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:46,187 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:46,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-11 16:01:46,388 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-11 16:01:46,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:46,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2024-11-11 16:01:46,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776397842] [2024-11-11 16:01:46,390 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 16:01:46,390 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-11 16:01:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:46,391 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-11 16:01:46,393 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-11 16:01:46,463 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-11 16:01:46,463 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:46,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-11 16:01:46,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:46,962 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-11 16:01:46,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:50,959 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-11 16:01:50,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776397842] [2024-11-11 16:01:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776397842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:50,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2024-11-11 16:01:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325768180] [2024-11-11 16:01:50,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:50,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-11 16:01:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:50,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-11 16:01:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2024-11-11 16:01:50,962 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-11 16:01:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:52,647 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-11-11 16:01:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-11 16:01:52,648 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-11 16:01:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:52,649 INFO L225 Difference]: With dead ends: 58 [2024-11-11 16:01:52,649 INFO L226 Difference]: Without dead ends: 52 [2024-11-11 16:01:52,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=691, Invalid=7681, Unknown=0, NotChecked=0, Total=8372 [2024-11-11 16:01:52,651 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 318 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:52,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 586 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:01:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-11 16:01:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-11 16:01:52,656 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-11 16:01:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-11 16:01:52,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2024-11-11 16:01:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:52,657 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-11 16:01:52,657 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-11 16:01:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-11 16:01:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 16:01:52,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:52,658 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:52,663 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-11 16:01:52,860 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-11 16:01:52,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2024-11-11 16:01:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:52,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680682274] [2024-11-11 16:01:52,862 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 16:01:52,862 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-11 16:01:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:52,864 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-11 16:01:52,865 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-11 16:01:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:52,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-11 16:01:52,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:53,497 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-11 16:01:53,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:58,740 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-11 16:01:58,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680682274] [2024-11-11 16:01:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680682274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:58,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2024-11-11 16:01:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144069940] [2024-11-11 16:01:58,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:58,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-11 16:01:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-11 16:01:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2024-11-11 16:01:58,743 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-11 16:02:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:00,882 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2024-11-11 16:02:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-11 16:02:00,882 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-11 16:02:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:00,883 INFO L225 Difference]: With dead ends: 64 [2024-11-11 16:02:00,883 INFO L226 Difference]: Without dead ends: 58 [2024-11-11 16:02:00,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=861, Invalid=10269, Unknown=0, NotChecked=0, Total=11130 [2024-11-11 16:02:00,886 INFO L435 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-11 16:02:00,886 INFO L436 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-11 16:02:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-11 16:02:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-11 16:02:00,891 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-11 16:02:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-11 16:02:00,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2024-11-11 16:02:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-11 16:02:00,892 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-11 16:02:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-11 16:02:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 16:02:00,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:00,893 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:00,897 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 (9)] Forceful destruction successful, exit code 0 [2024-11-11 16:02:01,096 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-11 16:02:01,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2024-11-11 16:02:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087618936] [2024-11-11 16:02:01,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:02:01,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:02:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:01,100 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-11 16:02:01,101 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-11 16:02:01,152 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:02:01,153 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:01,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 16:02:01,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:01,824 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-11 16:02:01,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:08,410 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-11 16:02:08,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087618936] [2024-11-11 16:02:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087618936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:08,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2024-11-11 16:02:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588083199] [2024-11-11 16:02:08,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:08,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-11 16:02:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-11 16:02:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2024-11-11 16:02:08,414 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-11 16:02:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:11,131 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2024-11-11 16:02:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-11 16:02:11,132 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-11 16:02:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:11,133 INFO L225 Difference]: With dead ends: 70 [2024-11-11 16:02:11,133 INFO L226 Difference]: Without dead ends: 64 [2024-11-11 16:02:11,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1047, Invalid=13233, Unknown=0, NotChecked=0, Total=14280 [2024-11-11 16:02:11,135 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 358 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:11,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 919 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 16:02:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-11 16:02:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-11 16:02:11,141 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-11 16:02:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-11 16:02:11,141 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2024-11-11 16:02:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:11,142 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-11 16:02:11,142 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-11 16:02:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-11 16:02:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 16:02:11,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:11,143 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:11,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-11 16:02:11,346 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-11 16:02:11,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:11,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2024-11-11 16:02:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:11,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273663409] [2024-11-11 16:02:11,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 16:02:11,347 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-11 16:02:11,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:11,350 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-11 16:02:11,354 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-11 16:02:11,439 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-11 16:02:11,439 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:11,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-11 16:02:11,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:12,306 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-11 16:02:12,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:20,036 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-11 16:02:20,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273663409] [2024-11-11 16:02:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273663409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:20,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2024-11-11 16:02:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997685835] [2024-11-11 16:02:20,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-11 16:02:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-11 16:02:20,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2024-11-11 16:02:20,043 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-11 16:02:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:23,052 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-11 16:02:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-11 16:02:23,052 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-11 16:02:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:23,056 INFO L225 Difference]: With dead ends: 76 [2024-11-11 16:02:23,056 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 16:02:23,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1249, Invalid=16573, Unknown=0, NotChecked=0, Total=17822 [2024-11-11 16:02:23,058 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 402 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:23,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1122 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 16:02:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 16:02:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 16:02:23,072 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-11 16:02:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2024-11-11 16:02:23,072 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2024-11-11 16:02:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:23,073 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2024-11-11 16:02:23,073 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-11 16:02:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2024-11-11 16:02:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 16:02:23,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:23,074 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:23,079 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-11 16:02:23,277 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-11 16:02:23,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:23,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2024-11-11 16:02:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236222452] [2024-11-11 16:02:23,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 16:02:23,278 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-11 16:02:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:23,280 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-11 16:02:23,282 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-11 16:02:23,378 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 16:02:23,379 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:23,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-11 16:02:23,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:24,374 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-11 16:02:24,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:34,460 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-11 16:02:34,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:34,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236222452] [2024-11-11 16:02:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236222452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:34,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2024-11-11 16:02:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937596207] [2024-11-11 16:02:34,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:34,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-11-11 16:02:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-11-11 16:02:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2024-11-11 16:02:34,467 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-11 16:02:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:38,280 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-11 16:02:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-11 16:02:38,281 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-11 16:02:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:38,283 INFO L225 Difference]: With dead ends: 82 [2024-11-11 16:02:38,283 INFO L226 Difference]: Without dead ends: 76 [2024-11-11 16:02:38,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1467, Invalid=20289, Unknown=0, NotChecked=0, Total=21756 [2024-11-11 16:02:38,286 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 806 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:38,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1450 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2688 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 16:02:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-11 16:02:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-11 16:02:38,293 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-11 16:02:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2024-11-11 16:02:38,294 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2024-11-11 16:02:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:38,298 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-11 16:02:38,299 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-11 16:02:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2024-11-11 16:02:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 16:02:38,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:38,299 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:38,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-11 16:02:38,500 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-11 16:02:38,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2024-11-11 16:02:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681608964] [2024-11-11 16:02:38,501 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 16:02:38,501 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-11 16:02:38,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:38,503 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-11 16:02:38,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-11 16:02:38,620 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-11 16:02:38,621 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:38,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-11 16:02:38,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:39,786 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-11 16:02:39,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-11 16:02:51,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681608964] [2024-11-11 16:02:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681608964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:51,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2024-11-11 16:02:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261992491] [2024-11-11 16:02:51,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-11-11 16:02:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-11-11 16:02:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2024-11-11 16:02:51,945 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-11-11 16:02:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:56,036 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2024-11-11 16:02:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-11 16:02:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 137 [2024-11-11 16:02:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:56,038 INFO L225 Difference]: With dead ends: 88 [2024-11-11 16:02:56,038 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 16:02:56,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1701, Invalid=24381, Unknown=0, NotChecked=0, Total=26082 [2024-11-11 16:02:56,062 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 268 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:56,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1710 Invalid, 3284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 16:02:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 16:02:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-11 16:02:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-11 16:02:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2024-11-11 16:02:56,076 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2024-11-11 16:02:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:56,076 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2024-11-11 16:02:56,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-11-11 16:02:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2024-11-11 16:02:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 16:02:56,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:56,077 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:02:56,082 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 (13)] Ended with exit code 0 [2024-11-11 16:02:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:02:56,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2024-11-11 16:02:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696970245] [2024-11-11 16:02:56,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 16:02:56,278 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-11 16:02:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:56,282 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:02:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-11 16:02:56,442 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-11 16:02:56,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:56,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-11 16:02:56,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-11 16:02:57,823 INFO L312 TraceCheckSpWp]: Computing backward predicates...