./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:32:40,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:32:40,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:32:40,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:32:40,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:32:40,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:32:40,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:32:40,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:32:40,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:32:40,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:32:40,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:32:40,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:32:40,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:32:40,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:32:40,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:32:40,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:32:40,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:32:40,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:32:40,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:32:40,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:32:40,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:32:40,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:32:40,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:32:40,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:32:40,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:32:40,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:32:40,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:32:40,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:32:40,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:32:40,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:32:40,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:32:40,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:32:40,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:40,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:32:40,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:32:40,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:32:40,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:32:40,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:32:40,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:32:40,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:32:40,595 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:32:40,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:32:40,596 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-09 18:32:40,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:40,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:40,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:40,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:40,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:40,833 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-09 18:32:42,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:42,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:42,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-09 18:32:42,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab1e2abd/1ae882a5e65b410db81ce4020a69a86e/FLAG462213db3 [2024-11-09 18:32:42,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab1e2abd/1ae882a5e65b410db81ce4020a69a86e [2024-11-09 18:32:42,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:42,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:42,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:42,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:42,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:42,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679cc11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42, skipping insertion in model container [2024-11-09 18:32:42,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:42,801 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-09 18:32:42,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:42,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:42,825 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-09 18:32:42,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:42,843 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:42,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42 WrapperNode [2024-11-09 18:32:42,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:42,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:42,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:42,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:42,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,871 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-09 18:32:42,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:42,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:42,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:42,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:42,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,890 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-09 18:32:42,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:42,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:42,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:42,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:42,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (1/1) ... [2024-11-09 18:32:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:42,928 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-09 18:32:42,932 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-09 18:32:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-09 18:32:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-09 18:32:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:32:43,031 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:43,033 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:43,104 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4; [2024-11-09 18:32:43,191 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:43,191 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:43,209 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:43,210 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:32:43,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:43 BoogieIcfgContainer [2024-11-09 18:32:43,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:43,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:43,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:43,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:43,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:42" (1/3) ... [2024-11-09 18:32:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4ee09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:43, skipping insertion in model container [2024-11-09 18:32:43,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:42" (2/3) ... [2024-11-09 18:32:43,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4ee09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:43, skipping insertion in model container [2024-11-09 18:32:43,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:43" (3/3) ... [2024-11-09 18:32:43,223 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-09 18:32:43,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:43,239 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:43,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:43,296 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;@39772c8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:43,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-09 18:32:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 18:32:43,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:43,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:43,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 71697647, now seen corresponding path program 1 times [2024-11-09 18:32:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161971142] [2024-11-09 18:32:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 18:32:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:43,583 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-09 18:32:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161971142] [2024-11-09 18:32:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161971142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657801968] [2024-11-09 18:32:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:43,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:43,613 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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.2) internal successors, (11), 4 states have internal predecessors, (11), 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-09 18:32:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:43,662 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-09 18:32:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-09 18:32:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:43,676 INFO L225 Difference]: With dead ends: 34 [2024-11-09 18:32:43,676 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 18:32:43,678 INFO L431 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-09 18:32:43,681 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:43,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 18:32:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 18:32:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-09 18:32:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-09 18:32:43,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-11-09 18:32:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-09 18:32:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-09 18:32:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-09 18:32:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 18:32:43,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:43,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:32:43,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:43,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 155241841, now seen corresponding path program 1 times [2024-11-09 18:32:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:43,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068435067] [2024-11-09 18:32:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 18:32:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:43,806 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-09 18:32:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068435067] [2024-11-09 18:32:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068435067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:43,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196095933] [2024-11-09 18:32:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:43,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:43,809 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 18:32:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:43,817 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 18:32:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-09 18:32:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:43,818 INFO L225 Difference]: With dead ends: 32 [2024-11-09 18:32:43,818 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 18:32:43,818 INFO L431 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-09 18:32:43,819 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:43,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 18:32:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-09 18:32:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-09 18:32:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-09 18:32:43,824 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2024-11-09 18:32:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:43,824 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-09 18:32:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09 18:32:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-09 18:32:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:32:43,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:43,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:43,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:32:43,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:43,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash 620994922, now seen corresponding path program 1 times [2024-11-09 18:32:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581410833] [2024-11-09 18:32:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:43,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:32:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:43,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:32:43,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:32:43,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:32:43,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:32:43,880 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 18:32:43,897 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:32:43,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:32:43 BoogieIcfgContainer [2024-11-09 18:32:43,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:32:43,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:32:43,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:32:43,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:32:43,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:43" (3/4) ... [2024-11-09 18:32:43,902 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 18:32:43,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:32:43,904 INFO L158 Benchmark]: Toolchain (without parser) took 1268.41ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 150.5MB in the end (delta: -25.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:43,904 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 121.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:43,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.16ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 112.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:32:43,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.15ms. Allocated memory is still 195.0MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:43,905 INFO L158 Benchmark]: Boogie Preprocessor took 23.69ms. Allocated memory is still 195.0MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:32:43,905 INFO L158 Benchmark]: IcfgBuilder took 314.71ms. Allocated memory is still 195.0MB. Free memory was 109.7MB in the beginning and 98.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:32:43,906 INFO L158 Benchmark]: TraceAbstraction took 685.29ms. Allocated memory is still 195.0MB. Free memory was 97.4MB in the beginning and 150.5MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:43,906 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 195.0MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:43,908 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.45ms. Allocated memory is still 121.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.16ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 112.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.15ms. Allocated memory is still 195.0MB. Free memory was 112.5MB in the beginning and 111.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.69ms. Allocated memory is still 195.0MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 314.71ms. Allocated memory is still 195.0MB. Free memory was 109.7MB in the beginning and 98.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 685.29ms. Allocated memory is still 195.0MB. Free memory was 97.4MB in the beginning and 150.5MB in the end (delta: -53.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 195.0MB. Free memory is still 150.5MB. 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-09 18:32:46,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:46,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:46,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:46,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:46,235 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:46,238 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-09 18:32:47,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:47,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:47,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-11-09 18:32:47,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2c7f18a/b8f46dd4392c40b6a85414f90094f234/FLAG5521b3967 [2024-11-09 18:32:47,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2c7f18a/b8f46dd4392c40b6a85414f90094f234 [2024-11-09 18:32:47,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:47,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:47,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:47,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:47,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:47,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:47" (1/1) ... [2024-11-09 18:32:47,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab87ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:47, skipping insertion in model container [2024-11-09 18:32:47,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:47" (1/1) ... [2024-11-09 18:32:47,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:47,989 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-09 18:32:47,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:48,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:48,020 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-09 18:32:48,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:48,034 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48 WrapperNode [2024-11-09 18:32:48,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:48,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:48,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:48,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:48,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,060 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-11-09 18:32:48,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:48,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:48,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:48,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:48,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,082 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-09 18:32:48,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:48,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:48,097 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:48,097 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:48,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (1/1) ... [2024-11-09 18:32:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:48,131 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-09 18:32:48,137 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-09 18:32:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-11-09 18:32:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-11-09 18:32:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 18:32:48,247 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:48,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:48,302 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4; [2024-11-09 18:32:48,356 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:48,356 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:48,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:48,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:32:48,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:48 BoogieIcfgContainer [2024-11-09 18:32:48,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:48,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:48,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:48,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:48,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:47" (1/3) ... [2024-11-09 18:32:48,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77786a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:48, skipping insertion in model container [2024-11-09 18:32:48,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:48" (2/3) ... [2024-11-09 18:32:48,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77786a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:48, skipping insertion in model container [2024-11-09 18:32:48,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:48" (3/3) ... [2024-11-09 18:32:48,370 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-11-09 18:32:48,382 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:48,383 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:48,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:48,426 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;@13e33631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:48,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-09 18:32:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 18:32:48,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:48,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:48,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2145442678, now seen corresponding path program 1 times [2024-11-09 18:32:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580225885] [2024-11-09 18:32:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:48,452 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-09 18:32:48,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:48,455 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-09 18:32:48,456 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-09 18:32:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:32:48,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:48,684 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-09 18:32:48,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:48,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580225885] [2024-11-09 18:32:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580225885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281287355] [2024-11-09 18:32:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:48,724 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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.6666666666666667) internal successors, (10), 6 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-09 18:32:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:48,809 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-09 18:32:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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-09 18:32:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:48,817 INFO L225 Difference]: With dead ends: 29 [2024-11-09 18:32:48,817 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 18:32:48,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-09 18:32:48,822 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 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-09 18:32:48,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 18:32:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-09 18:32:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-09 18:32:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-09 18:32:48,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-11-09 18:32:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:48,848 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-09 18:32:48,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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-09 18:32:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-09 18:32:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:32:48,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:48,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:48,857 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-09 18:32:49,053 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-09 18:32:49,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:49,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash -803054127, now seen corresponding path program 1 times [2024-11-09 18:32:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363750567] [2024-11-09 18:32:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:49,056 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-09 18:32:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:49,057 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-09 18:32:49,058 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-09 18:32:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:49,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:32:49,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:49,248 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-09 18:32:49,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:49,698 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-09 18:32:49,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363750567] [2024-11-09 18:32:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363750567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:49,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 18:32:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248610192] [2024-11-09 18:32:49,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:49,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 18:32:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 18:32:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:49,705 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 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-09 18:32:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:49,964 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-09 18:32:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 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 18 [2024-11-09 18:32:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:49,966 INFO L225 Difference]: With dead ends: 30 [2024-11-09 18:32:49,966 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 18:32:49,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 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-09 18:32:49,968 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:49,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 18:32:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 18:32:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 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-09 18:32:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-09 18:32:49,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2024-11-09 18:32:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-09 18:32:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 12 states have internal predecessors, (23), 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-09 18:32:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-09 18:32:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:32:49,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:49,981 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:49,984 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-09 18:32:50,184 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-09 18:32:50,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:50,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1505065807, now seen corresponding path program 2 times [2024-11-09 18:32:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380462069] [2024-11-09 18:32:50,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:32:50,186 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-09 18:32:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:50,188 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-09 18:32:50,189 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-09 18:32:50,214 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:32:50,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:32:50,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 18:32:50,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:50,438 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-09 18:32:50,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:51,312 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-09 18:32:51,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380462069] [2024-11-09 18:32:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380462069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:51,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-11-09 18:32:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940140312] [2024-11-09 18:32:51,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 18:32:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 18:32:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-09 18:32:51,317 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 18 states have internal predecessors, (35), 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-09 18:32:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:51,742 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-09 18:32:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 18:32:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 18 states have internal predecessors, (35), 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 30 [2024-11-09 18:32:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:51,744 INFO L225 Difference]: With dead ends: 36 [2024-11-09 18:32:51,744 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 18:32:51,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 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-09 18:32:51,745 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:51,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 123 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 18:32:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 18:32:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 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-09 18:32:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-09 18:32:51,754 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 30 [2024-11-09 18:32:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:51,755 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-09 18:32:51,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 18 states have internal predecessors, (35), 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-09 18:32:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-09 18:32:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 18:32:51,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:51,756 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:51,760 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-09 18:32:51,956 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-09 18:32:51,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:51,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:51,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1387838575, now seen corresponding path program 3 times [2024-11-09 18:32:51,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:51,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986895937] [2024-11-09 18:32:51,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 18:32:51,958 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-09 18:32:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:51,963 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-09 18:32:51,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 18:32:52,011 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 18:32:52,011 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:32:52,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 18:32:52,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:52,271 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-09 18:32:52,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:53,691 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-09 18:32:53,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986895937] [2024-11-09 18:32:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986895937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:53,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:53,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-11-09 18:32:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352752541] [2024-11-09 18:32:53,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:53,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 18:32:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 18:32:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 18:32:53,698 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 24 states have internal predecessors, (47), 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-09 18:32:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:54,307 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-09 18:32:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 18:32:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 24 states have internal predecessors, (47), 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 42 [2024-11-09 18:32:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:54,310 INFO L225 Difference]: With dead ends: 42 [2024-11-09 18:32:54,310 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 18:32:54,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 18:32:54,312 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:54,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 197 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 18:32:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 18:32:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 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-09 18:32:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-09 18:32:54,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 42 [2024-11-09 18:32:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:54,322 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-09 18:32:54,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 24 states have internal predecessors, (47), 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-09 18:32:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-09 18:32:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 18:32:54,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:54,325 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:54,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 18:32:54,527 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-09 18:32:54,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 862362225, now seen corresponding path program 4 times [2024-11-09 18:32:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83713762] [2024-11-09 18:32:54,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 18:32:54,529 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-09 18:32:54,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:54,532 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-09 18:32:54,532 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-09 18:32:54,556 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 18:32:54,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:32:54,557 WARN L253 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 18:32:54,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:54,890 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-09 18:32:54,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:56,932 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-09 18:32:56,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83713762] [2024-11-09 18:32:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83713762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:56,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2024-11-09 18:32:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270992829] [2024-11-09 18:32:56,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:56,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 18:32:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 18:32:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 18:32:56,935 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 30 states have internal predecessors, (59), 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-09 18:32:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:57,791 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-09 18:32:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 18:32:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 30 states have internal predecessors, (59), 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 54 [2024-11-09 18:32:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:57,795 INFO L225 Difference]: With dead ends: 48 [2024-11-09 18:32:57,795 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 18:32:57,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 18:32:57,796 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:57,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 298 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:32:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 18:32:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 18:32:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 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-09 18:32:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-09 18:32:57,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 54 [2024-11-09 18:32:57,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-09 18:32:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 30 states have internal predecessors, (59), 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-09 18:32:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-09 18:32:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 18:32:57,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:57,808 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:57,812 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-09 18:32:58,009 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-09 18:32:58,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:58,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash -461993647, now seen corresponding path program 5 times [2024-11-09 18:32:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642510149] [2024-11-09 18:32:58,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 18:32:58,010 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-09 18:32:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:58,013 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-09 18:32:58,013 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-09 18:32:58,059 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-09 18:32:58,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:32:58,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 18:32:58,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:58,373 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-09 18:32:58,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:01,087 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-09 18:33:01,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642510149] [2024-11-09 18:33:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642510149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:01,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2024-11-09 18:33:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176709692] [2024-11-09 18:33:01,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-09 18:33:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 18:33:01,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 18:33:01,090 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 36 states have internal predecessors, (71), 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-09 18:33:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:02,284 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-09 18:33:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 18:33:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 36 states have internal predecessors, (71), 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 66 [2024-11-09 18:33:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:02,286 INFO L225 Difference]: With dead ends: 54 [2024-11-09 18:33:02,287 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 18:33:02,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=537, Invalid=5469, Unknown=0, NotChecked=0, Total=6006 [2024-11-09 18:33:02,289 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 184 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:02,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 403 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:33:02,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 18:33:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 18:33:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 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-09 18:33:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-09 18:33:02,299 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 66 [2024-11-09 18:33:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-09 18:33:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 36 states have internal predecessors, (71), 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-09 18:33:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-09 18:33:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 18:33:02,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:02,303 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:02,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:02,503 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-09 18:33:02,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:02,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1446703055, now seen corresponding path program 6 times [2024-11-09 18:33:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857088251] [2024-11-09 18:33:02,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 18:33:02,505 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-09 18:33:02,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:02,508 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-09 18:33:02,509 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-09 18:33:02,559 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-09 18:33:02,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:33:02,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 18:33:02,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:02,994 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-09 18:33:02,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:06,571 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-09 18:33:06,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857088251] [2024-11-09 18:33:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857088251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:06,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2024-11-09 18:33:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232924012] [2024-11-09 18:33:06,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:06,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-09 18:33:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-09 18:33:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2024-11-09 18:33:06,574 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 66 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 42 states have internal predecessors, (83), 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-09 18:33:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:08,068 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-09 18:33:08,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 18:33:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 42 states have internal predecessors, (83), 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 78 [2024-11-09 18:33:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:08,070 INFO L225 Difference]: With dead ends: 60 [2024-11-09 18:33:08,070 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 18:33:08,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=691, Invalid=7681, Unknown=0, NotChecked=0, Total=8372 [2024-11-09 18:33:08,072 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 318 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:08,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 588 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:33:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 18:33:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 18:33:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 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-09 18:33:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-11-09 18:33:08,078 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 78 [2024-11-09 18:33:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:08,078 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-11-09 18:33:08,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 42 states have internal predecessors, (83), 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-09 18:33:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-09 18:33:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 18:33:08,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:08,079 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:08,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 18:33:08,279 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-09 18:33:08,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1977602287, now seen corresponding path program 7 times [2024-11-09 18:33:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153386203] [2024-11-09 18:33:08,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 18:33:08,281 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-09 18:33:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:08,283 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-09 18:33:08,284 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-09 18:33:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:08,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 18:33:08,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:08,845 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-09 18:33:08,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:13,497 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-09 18:33:13,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153386203] [2024-11-09 18:33:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153386203] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:13,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:13,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2024-11-09 18:33:13,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660263931] [2024-11-09 18:33:13,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:13,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-09 18:33:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-09 18:33:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 18:33:13,500 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 76 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 48 states have internal predecessors, (95), 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-09 18:33:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:15,481 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-11-09 18:33:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 18:33:15,481 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 48 states have internal predecessors, (95), 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 90 [2024-11-09 18:33:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:15,482 INFO L225 Difference]: With dead ends: 66 [2024-11-09 18:33:15,482 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 18:33:15,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=861, Invalid=10269, Unknown=0, NotChecked=0, Total=11130 [2024-11-09 18:33:15,485 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:15,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1020 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 18:33:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 18:33:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 18:33:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.025) internal successors, (41), 41 states have internal predecessors, (41), 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-09 18:33:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2024-11-09 18:33:15,490 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 90 [2024-11-09 18:33:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:15,491 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2024-11-09 18:33:15,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 48 states have internal predecessors, (95), 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-09 18:33:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2024-11-09 18:33:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 18:33:15,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:15,492 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:15,496 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-09 18:33:15,692 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-09 18:33:15,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1982470671, now seen corresponding path program 8 times [2024-11-09 18:33:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428757754] [2024-11-09 18:33:15,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:33:15,693 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-09 18:33:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:15,695 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-09 18:33:15,696 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-09 18:33:15,747 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:33:15,747 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:33:15,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-09 18:33:15,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:16,358 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-09 18:33:16,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:22,471 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-09 18:33:22,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428757754] [2024-11-09 18:33:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428757754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:22,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2024-11-09 18:33:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532018648] [2024-11-09 18:33:22,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:22,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-09 18:33:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-09 18:33:22,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2024-11-09 18:33:22,474 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 54 states have internal predecessors, (107), 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-09 18:33:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:24,925 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-11-09 18:33:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 18:33:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 54 states have internal predecessors, (107), 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 102 [2024-11-09 18:33:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:24,927 INFO L225 Difference]: With dead ends: 72 [2024-11-09 18:33:24,927 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 18:33:24,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1047, Invalid=13233, Unknown=0, NotChecked=0, Total=14280 [2024-11-09 18:33:24,929 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 356 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:24,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 894 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 18:33:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 18:33:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 18:33:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 45 states have internal predecessors, (45), 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-09 18:33:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2024-11-09 18:33:24,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 102 [2024-11-09 18:33:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2024-11-09 18:33:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 54 states have internal predecessors, (107), 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-09 18:33:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2024-11-09 18:33:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 18:33:24,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:24,937 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:24,941 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-09 18:33:25,138 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-09 18:33:25,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:25,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1967901487, now seen corresponding path program 9 times [2024-11-09 18:33:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678565170] [2024-11-09 18:33:25,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 18:33:25,139 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-09 18:33:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:25,140 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-09 18:33:25,141 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-09 18:33:25,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-11-09 18:33:25,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:33:25,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-09 18:33:25,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:25,979 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-09 18:33:25,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:33,585 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-09 18:33:33,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:33,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678565170] [2024-11-09 18:33:33,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678565170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:33,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2024-11-09 18:33:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593067312] [2024-11-09 18:33:33,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:33,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-09 18:33:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-09 18:33:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 18:33:33,587 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 96 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 60 states have internal predecessors, (119), 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-09 18:33:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:36,513 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-09 18:33:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-09 18:33:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 60 states have internal predecessors, (119), 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 114 [2024-11-09 18:33:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:36,515 INFO L225 Difference]: With dead ends: 78 [2024-11-09 18:33:36,515 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 18:33:36,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1249, Invalid=16573, Unknown=0, NotChecked=0, Total=17822 [2024-11-09 18:33:36,516 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 474 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:36,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1271 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 18:33:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 18:33:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 18:33:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 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-09 18:33:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-11-09 18:33:36,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 114 [2024-11-09 18:33:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:36,526 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-11-09 18:33:36,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 60 states have internal predecessors, (119), 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-09 18:33:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-11-09 18:33:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 18:33:36,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:36,528 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:36,531 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 (11)] Ended with exit code 0 [2024-11-09 18:33:36,728 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-09 18:33:36,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:36,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 738794417, now seen corresponding path program 10 times [2024-11-09 18:33:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646961474] [2024-11-09 18:33:36,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 18:33:36,729 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-09 18:33:36,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:36,730 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-09 18:33:36,731 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-09 18:33:36,810 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 18:33:36,810 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:33:36,813 WARN L253 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 18:33:36,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:37,673 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-09 18:33:37,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:47,066 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-09 18:33:47,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646961474] [2024-11-09 18:33:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646961474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:47,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2024-11-09 18:33:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705479227] [2024-11-09 18:33:47,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:47,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-11-09 18:33:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-11-09 18:33:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2024-11-09 18:33:47,069 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 106 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 66 states have internal predecessors, (131), 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-09 18:33:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:50,637 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2024-11-09 18:33:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 18:33:50,637 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 66 states have internal predecessors, (131), 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 126 [2024-11-09 18:33:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:50,638 INFO L225 Difference]: With dead ends: 84 [2024-11-09 18:33:50,638 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 18:33:50,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1467, Invalid=20289, Unknown=0, NotChecked=0, Total=21756 [2024-11-09 18:33:50,640 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 806 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:50,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1397 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 18:33:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 18:33:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 18:33:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 53 states have internal predecessors, (53), 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-09 18:33:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2024-11-09 18:33:50,647 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 126 [2024-11-09 18:33:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:50,647 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2024-11-09 18:33:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 66 states have internal predecessors, (131), 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-09 18:33:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2024-11-09 18:33:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 18:33:50,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:50,649 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:50,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:50,849 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-09 18:33:50,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1432184175, now seen corresponding path program 11 times [2024-11-09 18:33:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416097752] [2024-11-09 18:33:50,850 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 18:33:50,850 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-09 18:33:50,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:50,853 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-09 18:33:50,853 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-09 18:33:50,981 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-09 18:33:50,981 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:33:50,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-09 18:33:50,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:52,016 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-09 18:33:52,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:34:03,199 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-09 18:34:03,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:34:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416097752] [2024-11-09 18:34:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416097752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:34:03,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:34:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2024-11-09 18:34:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409852246] [2024-11-09 18:34:03,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:34:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-11-09 18:34:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:34:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-11-09 18:34:03,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2024-11-09 18:34:03,202 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 116 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 72 states have internal predecessors, (143), 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-09 18:34:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:34:07,471 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2024-11-09 18:34:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 18:34:07,472 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 72 states have internal predecessors, (143), 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 138 [2024-11-09 18:34:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:34:07,473 INFO L225 Difference]: With dead ends: 90 [2024-11-09 18:34:07,473 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 18:34:07,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1701, Invalid=24381, Unknown=0, NotChecked=0, Total=26082 [2024-11-09 18:34:07,484 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 136 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 3592 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 18:34:07,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1881 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 18:34:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 18:34:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 18:34:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 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-09 18:34:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2024-11-09 18:34:07,494 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 138 [2024-11-09 18:34:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:34:07,495 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2024-11-09 18:34:07,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 72 states have internal predecessors, (143), 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-09 18:34:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2024-11-09 18:34:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 18:34:07,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:34:07,496 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:34:07,503 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-09 18:34:07,697 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-09 18:34:07,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:34:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:34:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1060195983, now seen corresponding path program 12 times [2024-11-09 18:34:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:34:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351968615] [2024-11-09 18:34:07,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 18:34:07,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:34:07,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:34:07,699 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-09 18:34:07,700 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-09 18:34:07,868 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-09 18:34:07,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:34:07,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-09 18:34:07,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:34:09,046 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-09 18:34:09,046 INFO L311 TraceCheckSpWp]: Computing backward predicates...