/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:22:39,232 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:22:39,291 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-06 00:22:39,294 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:22:39,295 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:22:39,317 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:22:39,318 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:22:39,318 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:22:39,319 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:22:39,320 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:22:39,320 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:22:39,321 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:22:39,321 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:22:39,321 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:22:39,321 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:22:39,322 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:22:39,322 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:22:39,322 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:22:39,325 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:22:39,325 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:22:39,325 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:22:39,329 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:22:39,329 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:22:39,330 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:22:39,331 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:22:39,332 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:22:39,332 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:22:39,333 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:22:39,334 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:22:39,334 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:22:39,334 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:22:39,334 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: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF
[2024-11-06 00:22:39,501 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:22:39,521 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:22:39,523 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:22:39,524 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:22:39,528 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:22:39,529 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c
[2024-11-06 00:22:41,091 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:22:41,377 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:22:41,378 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c
[2024-11-06 00:22:41,398 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8110306/9a3395eb296e46bcb4487e09ebd78d61/FLAG48d7166b8
[2024-11-06 00:22:41,698 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8110306/9a3395eb296e46bcb4487e09ebd78d61
[2024-11-06 00:22:41,704 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:22:41,705 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:22:41,706 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:22:41,706 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:22:41,718 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:22:41,720 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:41" (1/1) ...
[2024-11-06 00:22:41,721 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8299e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:41, skipping insertion in model container
[2024-11-06 00:22:41,721 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:41" (1/1) ...
[2024-11-06 00:22:41,763 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:22:42,053 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477]
[2024-11-06 00:22:42,065 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:22:42,086 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:22:42,111 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477]
[2024-11-06 00:22:42,115 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:22:42,140 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:22:42,140 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42 WrapperNode
[2024-11-06 00:22:42,140 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:22:42,141 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:22:42,142 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:22:42,142 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:22:42,148 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,154 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,168 INFO  L138                Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86
[2024-11-06 00:22:42,169 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:22:42,169 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:22:42,169 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:22:42,170 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:22:42,177 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,177 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,180 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,193 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-06 00:22:42,197 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,198 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,204 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,211 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,212 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,213 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,222 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:22:42,223 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:22:42,223 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:22:42,223 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:22:42,224 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (1/1) ...
[2024-11-06 00:22:42,228 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:22:42,238 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:22:42,252 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-06 00:22:42,256 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-06 00:22:42,277 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:22:42,278 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:22:42,278 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:22:42,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:22:42,362 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:22:42,364 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:22:43,278 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2024-11-06 00:22:43,278 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:22:43,288 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:22:43,288 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-06 00:22:43,289 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:43 BoogieIcfgContainer
[2024-11-06 00:22:43,289 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:22:43,291 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:22:43,291 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:22:43,293 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:22:43,293 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:41" (1/3) ...
[2024-11-06 00:22:43,294 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b27cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:43, skipping insertion in model container
[2024-11-06 00:22:43,294 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:42" (2/3) ...
[2024-11-06 00:22:43,294 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b27cbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:22:43, skipping insertion in model container
[2024-11-06 00:22:43,294 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:22:43" (3/3) ...
[2024-11-06 00:22:43,295 INFO  L112   eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c
[2024-11-06 00:22:43,308 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:22:43,308 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:22:43,355 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:22:43,364 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;@7ec56310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:22:43,365 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:22:43,369 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:22:43,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-06 00:22:43,373 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:22:43,374 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:22:43,375 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:22:43,379 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:22:43,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times
[2024-11-06 00:22:43,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:22:43,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238113772]
[2024-11-06 00:22:43,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:22:43,445 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-06 00:22:43,445 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:22:43,452 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-06 00:22:43,453 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-06 00:22:43,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:22:43,601 INFO  L255         TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:22:43,606 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:22:43,663 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-06 00:22:43,663 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:22:43,664 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:22:43,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238113772]
[2024-11-06 00:22:43,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [238113772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:22:43,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:22:43,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-06 00:22:43,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530808426]
[2024-11-06 00:22:43,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:22:43,670 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:22:43,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:22:43,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:22:43,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:22:43,688 INFO  L87              Difference]: Start difference. First operand  has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:22:43,718 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:22:43,718 INFO  L93              Difference]: Finished difference Result 31 states and 42 transitions.
[2024-11-06 00:22:43,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:22:43,721 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2024-11-06 00:22:43,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:22:43,727 INFO  L225             Difference]: With dead ends: 31
[2024-11-06 00:22:43,727 INFO  L226             Difference]: Without dead ends: 23
[2024-11-06 00:22:43,729 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:22:43,731 INFO  L432           NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-06 00:22:43,732 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 00:22:43,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2024-11-06 00:22:43,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2024-11-06 00:22:43,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:22:43,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions.
[2024-11-06 00:22:43,753 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16
[2024-11-06 00:22:43,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:22:43,754 INFO  L471      AbstractCegarLoop]: Abstraction has 23 states and 31 transitions.
[2024-11-06 00:22:43,754 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:22:43,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions.
[2024-11-06 00:22:43,754 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-06 00:22:43,754 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:22:43,754 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:22:43,763 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-06 00:22:43,958 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-06 00:22:43,959 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:22:43,960 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:22:43,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times
[2024-11-06 00:22:43,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:22:43,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460511572]
[2024-11-06 00:22:43,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:22:43,960 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-06 00:22:43,961 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:22:43,964 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-06 00:22:43,965 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-06 00:22:44,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:22:44,053 INFO  L255         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-06 00:22:44,054 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:22:51,724 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-06 00:22:51,725 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:22:51,725 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:22:51,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460511572]
[2024-11-06 00:22:51,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460511572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:22:51,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:22:51,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-06 00:22:51,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765227465]
[2024-11-06 00:22:51,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:22:51,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-06 00:22:51,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:22:51,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-06 00:22:51,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=23, Unknown=1, NotChecked=0, Total=42
[2024-11-06 00:22:51,728 INFO  L87              Difference]: Start difference. First operand 23 states and 31 transitions. Second operand  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:22:53,661 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:22:58,487 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:00,558 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:03,476 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:05,065 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:07,856 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:11,272 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:15,972 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:19,075 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:23,587 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:24,819 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:28,698 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:32,805 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:36,916 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:37,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:23:37,828 INFO  L93              Difference]: Finished difference Result 75 states and 103 transitions.
[2024-11-06 00:23:37,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-06 00:23:37,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2024-11-06 00:23:37,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:23:37,837 INFO  L225             Difference]: With dead ends: 75
[2024-11-06 00:23:37,837 INFO  L226             Difference]: Without dead ends: 54
[2024-11-06 00:23:37,837 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=18, Invalid=23, Unknown=1, NotChecked=0, Total=42
[2024-11-06 00:23:37,840 INFO  L432           NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.1s IncrementalHoareTripleChecker+Time
[2024-11-06 00:23:37,840 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 52 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 46.1s Time]
[2024-11-06 00:23:37,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-06 00:23:37,846 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34.
[2024-11-06 00:23:37,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:37,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions.
[2024-11-06 00:23:37,847 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16
[2024-11-06 00:23:37,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:23:37,848 INFO  L471      AbstractCegarLoop]: Abstraction has 34 states and 47 transitions.
[2024-11-06 00:23:37,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:37,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions.
[2024-11-06 00:23:37,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-06 00:23:37,848 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:23:37,848 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:23:37,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 (3)] Ended with exit code 0
[2024-11-06 00:23:38,049 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-06 00:23:38,049 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:23:38,052 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:23:38,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times
[2024-11-06 00:23:38,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:23:38,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840542674]
[2024-11-06 00:23:38,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:23:38,057 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-06 00:23:38,057 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:23:38,061 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-06 00:23:38,063 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-06 00:23:38,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:23:38,152 INFO  L255         TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 00:23:38,153 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:23:38,240 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-06 00:23:38,241 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:23:38,241 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:23:38,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840542674]
[2024-11-06 00:23:38,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [840542674] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:23:38,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:23:38,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:23:38,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734029152]
[2024-11-06 00:23:38,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:23:38,242 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 00:23:38,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:23:38,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 00:23:38,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 00:23:38,245 INFO  L87              Difference]: Start difference. First operand 34 states and 47 transitions. Second operand  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:38,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:23:38,395 INFO  L93              Difference]: Finished difference Result 56 states and 77 transitions.
[2024-11-06 00:23:38,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 00:23:38,405 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2024-11-06 00:23:38,405 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:23:38,405 INFO  L225             Difference]: With dead ends: 56
[2024-11-06 00:23:38,405 INFO  L226             Difference]: Without dead ends: 33
[2024-11-06 00:23:38,406 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-06 00:23:38,406 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-06 00:23:38,407 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-06 00:23:38,407 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2024-11-06 00:23:38,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2024-11-06 00:23:38,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:38,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions.
[2024-11-06 00:23:38,410 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16
[2024-11-06 00:23:38,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:23:38,410 INFO  L471      AbstractCegarLoop]: Abstraction has 33 states and 42 transitions.
[2024-11-06 00:23:38,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:38,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions.
[2024-11-06 00:23:38,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-06 00:23:38,411 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:23:38,411 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:23:38,418 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-06 00:23:38,611 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-06 00:23:38,612 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:23:38,614 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:23:38,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times
[2024-11-06 00:23:38,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:23:38,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566356209]
[2024-11-06 00:23:38,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:23:38,615 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-06 00:23:38,615 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:23:38,616 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-06 00:23:38,617 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-06 00:23:38,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:23:38,729 INFO  L255         TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-06 00:23:38,730 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:23:44,040 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-06 00:23:44,041 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:23:44,041 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:23:44,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566356209]
[2024-11-06 00:23:44,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566356209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:23:44,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:23:44,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-06 00:23:44,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429885479]
[2024-11-06 00:23:44,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:23:44,042 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-06 00:23:44,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:23:44,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-06 00:23:44,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-06 00:23:44,044 INFO  L87              Difference]: Start difference. First operand 33 states and 42 transitions. Second operand  has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:59,665 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]
[2024-11-06 00:23:59,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:23:59,955 INFO  L93              Difference]: Finished difference Result 72 states and 92 transitions.
[2024-11-06 00:23:59,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-06 00:23:59,961 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2024-11-06 00:23:59,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:23:59,963 INFO  L225             Difference]: With dead ends: 72
[2024-11-06 00:23:59,963 INFO  L226             Difference]: Without dead ends: 52
[2024-11-06 00:23:59,963 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-06 00:23:59,964 INFO  L432           NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time
[2024-11-06 00:23:59,967 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time]
[2024-11-06 00:23:59,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-11-06 00:23:59,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34.
[2024-11-06 00:23:59,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:59,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions.
[2024-11-06 00:23:59,972 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17
[2024-11-06 00:23:59,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:23:59,973 INFO  L471      AbstractCegarLoop]: Abstraction has 34 states and 44 transitions.
[2024-11-06 00:23:59,973 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:23:59,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions.
[2024-11-06 00:23:59,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-06 00:23:59,976 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:23:59,976 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:23:59,982 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-06 00:24:00,176 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-06 00:24:00,177 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:24:00,177 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:24:00,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times
[2024-11-06 00:24:00,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:24:00,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239460957]
[2024-11-06 00:24:00,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:24:00,179 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-06 00:24:00,179 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:24:00,180 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-06 00:24:00,182 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-06 00:24:00,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:24:00,244 INFO  L255         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:24:00,246 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:24:04,522 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-06 00:24:04,523 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:24:04,523 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:24:04,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239460957]
[2024-11-06 00:24:04,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [239460957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:24:04,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:24:04,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-06 00:24:04,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310985687]
[2024-11-06 00:24:04,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:24:04,524 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-06 00:24:04,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:24:04,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-06 00:24:04,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:24:04,525 INFO  L87              Difference]: Start difference. First operand 34 states and 44 transitions. Second operand  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:24:24,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:24:24,133 INFO  L93              Difference]: Finished difference Result 98 states and 122 transitions.
[2024-11-06 00:24:24,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-06 00:24:24,151 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2024-11-06 00:24:24,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:24:24,152 INFO  L225             Difference]: With dead ends: 98
[2024-11-06 00:24:24,153 INFO  L226             Difference]: Without dead ends: 78
[2024-11-06 00:24:24,153 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-06 00:24:24,154 INFO  L432           NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time
[2024-11-06 00:24:24,154 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time]
[2024-11-06 00:24:24,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-06 00:24:24,163 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49.
[2024-11-06 00:24:24,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:24:24,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions.
[2024-11-06 00:24:24,164 INFO  L78                 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17
[2024-11-06 00:24:24,164 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:24:24,165 INFO  L471      AbstractCegarLoop]: Abstraction has 49 states and 63 transitions.
[2024-11-06 00:24:24,165 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:24:24,165 INFO  L276                IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions.
[2024-11-06 00:24:24,165 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-06 00:24:24,165 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:24:24,165 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:24:24,181 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-06 00:24:24,366 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-06 00:24:24,368 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:24:24,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:24:24,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times
[2024-11-06 00:24:24,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:24:24,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920420744]
[2024-11-06 00:24:24,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:24:24,369 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-06 00:24:24,369 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:24:24,371 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-06 00:24:24,373 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-06 00:24:24,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:24:24,512 INFO  L255         TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-06 00:24:24,513 INFO  L278         TraceCheckSpWp]: Computing forward predicates...