/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/num_conversion_2.c


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


This is Ultimate 0.2.5-dev-df9f019-m
[2024-11-05 20:28:35,548 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-05 20:28:35,611 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-05 20:28:35,619 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-05 20:28:35,619 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-05 20:28:35,647 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-05 20:28:35,648 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-05 20:28:35,648 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-05 20:28:35,649 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-05 20:28:35,649 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-05 20:28:35,649 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-05 20:28:35,649 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-05 20:28:35,650 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-05 20:28:35,650 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-05 20:28:35,651 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-05 20:28:35,651 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-05 20:28:35,651 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-05 20:28:35,652 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-05 20:28:35,652 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-05 20:28:35,652 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-05 20:28:35,652 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-05 20:28:35,656 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-05 20:28:35,656 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-05 20:28:35,656 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-05 20:28:35,656 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-05 20:28:35,657 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-05 20:28:35,657 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-05 20:28:35,657 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-05 20:28:35,657 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-05 20:28:35,657 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-05 20:28:35,658 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-05 20:28:35,658 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-05 20:28:35,658 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-05 20:28:35,658 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-05 20:28:35,659 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 20:28:35,659 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-05 20:28:35,659 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-05 20:28:35,660 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-05 20:28:35,660 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-05 20:28:35,660 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-05 20:28:35,660 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-05 20:28:35,661 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-05 20:28:35,661 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-05 20:28:35,661 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-05 20:28:35,661 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
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: SMT solver -> External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -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-05 20:28:35,895 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-05 20:28:35,918 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-05 20:28:35,922 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-05 20:28:35,923 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-05 20:28:35,924 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-05 20:28:35,926 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/num_conversion_2.c
[2024-11-05 20:28:37,358 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-05 20:28:37,525 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-05 20:28:37,525 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c
[2024-11-05 20:28:37,530 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215995cdd/e2b39a60c1bc44b18506ea77e793f1cb/FLAG7e72cf428
[2024-11-05 20:28:37,543 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215995cdd/e2b39a60c1bc44b18506ea77e793f1cb
[2024-11-05 20:28:37,546 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-05 20:28:37,547 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-05 20:28:37,548 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-05 20:28:37,548 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-05 20:28:37,554 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-05 20:28:37,554 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,555 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f69b2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37, skipping insertion in model container
[2024-11-05 20:28:37,556 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,572 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-05 20:28:37,725 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698]
[2024-11-05 20:28:37,745 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 20:28:37,755 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-05 20:28:37,764 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/num_conversion_2.c[685,698]
[2024-11-05 20:28:37,768 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 20:28:37,784 INFO  L204         MainTranslator]: Completed translation
[2024-11-05 20:28:37,784 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37 WrapperNode
[2024-11-05 20:28:37,784 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-05 20:28:37,785 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-05 20:28:37,785 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-05 20:28:37,786 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-05 20:28:37,792 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,798 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,816 INFO  L138                Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35
[2024-11-05 20:28:37,817 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-05 20:28:37,818 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-05 20:28:37,818 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-05 20:28:37,818 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-05 20:28:37,830 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,830 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,831 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,843 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-05 20:28:37,843 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,844 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,848 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,850 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,851 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,853 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,855 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-05 20:28:37,856 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-05 20:28:37,856 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-05 20:28:37,856 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-05 20:28:37,857 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (1/1) ...
[2024-11-05 20:28:37,865 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 20:28:37,876 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-05 20:28:37,893 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-05 20:28:37,897 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-05 20:28:37,925 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-05 20:28:37,925 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-05 20:28:37,925 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-05 20:28:37,925 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-05 20:28:37,993 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-05 20:28:37,996 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-05 20:28:38,161 INFO  L?                        ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-05 20:28:38,162 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-05 20:28:38,171 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-05 20:28:38,172 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-05 20:28:38,172 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:38 BoogieIcfgContainer
[2024-11-05 20:28:38,172 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-05 20:28:38,175 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-05 20:28:38,175 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-05 20:28:38,179 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-05 20:28:38,180 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:28:37" (1/3) ...
[2024-11-05 20:28:38,181 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76179c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:38, skipping insertion in model container
[2024-11-05 20:28:38,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:37" (2/3) ...
[2024-11-05 20:28:38,181 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76179c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:38, skipping insertion in model container
[2024-11-05 20:28:38,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:38" (3/3) ...
[2024-11-05 20:28:38,183 INFO  L112   eAbstractionObserver]: Analyzing ICFG num_conversion_2.c
[2024-11-05 20:28:38,198 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-05 20:28:38,198 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-05 20:28:38,246 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-05 20:28:38,252 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;@775d6c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-05 20:28:38,252 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-05 20:28:38,256 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-05 20:28:38,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-05 20:28:38,261 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:38,262 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:38,262 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:38,266 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:38,266 INFO  L85        PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times
[2024-11-05 20:28:38,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:38,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108349956]
[2024-11-05 20:28:38,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:38,274 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-05 20:28:38,274 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:38,276 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-05 20:28:38,278 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-05 20:28:38,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:38,329 INFO  L255         TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:38,332 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:38,343 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-05 20:28:38,344 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 20:28:38,347 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-05 20:28:38,347 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 20:28:38,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108349956]
[2024-11-05 20:28:38,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2108349956] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-05 20:28:38,348 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-05 20:28:38,348 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2
[2024-11-05 20:28:38,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158190399]
[2024-11-05 20:28:38,350 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-05 20:28:38,353 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-05 20:28:38,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 20:28:38,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-05 20:28:38,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-05 20:28:38,370 INFO  L87              Difference]: Start difference. First operand  has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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) Second operand  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-05 20:28:38,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 20:28:38,380 INFO  L93              Difference]: Finished difference Result 21 states and 24 transitions.
[2024-11-05 20:28:38,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-05 20:28:38,381 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6
[2024-11-05 20:28:38,382 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 20:28:38,386 INFO  L225             Difference]: With dead ends: 21
[2024-11-05 20:28:38,387 INFO  L226             Difference]: Without dead ends: 9
[2024-11-05 20:28:38,389 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-05 20:28:38,392 INFO  L432           NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-05 20:28:38,393 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 20:28:38,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-05 20:28:38,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-05 20:28:38,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-05 20:28:38,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2024-11-05 20:28:38,421 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6
[2024-11-05 20:28:38,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 20:28:38,421 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 10 transitions.
[2024-11-05 20:28:38,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-05 20:28:38,422 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions.
[2024-11-05 20:28:38,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-05 20:28:38,422 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:38,422 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:38,426 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-05 20:28:38,623 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-05 20:28:38,624 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:38,624 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:38,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times
[2024-11-05 20:28:38,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:38,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [403466827]
[2024-11-05 20:28:38,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:38,625 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-05 20:28:38,625 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:38,627 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-05 20:28:38,628 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-05 20:28:38,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:38,661 INFO  L255         TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:38,662 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:38,686 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-05 20:28:38,687 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 20:28:38,697 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-05 20:28:38,698 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 20:28:38,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [403466827]
[2024-11-05 20:28:38,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [403466827] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-05 20:28:38,701 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-05 20:28:38,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4
[2024-11-05 20:28:38,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722705875]
[2024-11-05 20:28:38,701 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-05 20:28:38,702 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-05 20:28:38,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 20:28:38,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-05 20:28:38,703 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-05 20:28:38,704 INFO  L87              Difference]: Start difference. First operand 9 states and 10 transitions. Second operand  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 20:28:38,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 20:28:38,728 INFO  L93              Difference]: Finished difference Result 17 states and 20 transitions.
[2024-11-05 20:28:38,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-05 20:28:38,728 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 6
[2024-11-05 20:28:38,729 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 20:28:38,729 INFO  L225             Difference]: With dead ends: 17
[2024-11-05 20:28:38,729 INFO  L226             Difference]: Without dead ends: 13
[2024-11-05 20:28:38,729 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-05 20:28:38,732 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-05 20:28:38,732 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 20:28:38,733 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2024-11-05 20:28:38,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2024-11-05 20:28:38,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 20:28:38,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions.
[2024-11-05 20:28:38,736 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6
[2024-11-05 20:28:38,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 20:28:38,736 INFO  L471      AbstractCegarLoop]: Abstraction has 13 states and 15 transitions.
[2024-11-05 20:28:38,737 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 20:28:38,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions.
[2024-11-05 20:28:38,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-05 20:28:38,737 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:38,737 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:38,741 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-05 20:28:38,938 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-05 20:28:38,938 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:38,939 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:38,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 1 times
[2024-11-05 20:28:38,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:38,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112378629]
[2024-11-05 20:28:38,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:38,940 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-05 20:28:38,940 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:38,942 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-05 20:28:38,943 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-05 20:28:38,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:38,980 INFO  L255         TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:38,981 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:39,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:39,048 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 20:28:39,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:39,110 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 20:28:39,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112378629]
[2024-11-05 20:28:39,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1112378629] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 20:28:39,111 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 20:28:39,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-05 20:28:39,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138074988]
[2024-11-05 20:28:39,111 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 20:28:39,111 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-05 20:28:39,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 20:28:39,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-05 20:28:39,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-05 20:28:39,113 INFO  L87              Difference]: Start difference. First operand 13 states and 15 transitions. Second operand  has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-05 20:28:39,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 20:28:39,189 INFO  L93              Difference]: Finished difference Result 29 states and 38 transitions.
[2024-11-05 20:28:39,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-05 20:28:39,190 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2024-11-05 20:28:39,190 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 20:28:39,190 INFO  L225             Difference]: With dead ends: 29
[2024-11-05 20:28:39,190 INFO  L226             Difference]: Without dead ends: 25
[2024-11-05 20:28:39,191 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-05 20:28:39,192 INFO  L432           NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-05 20:28:39,192 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 20:28:39,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2024-11-05 20:28:39,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2024-11-05 20:28:39,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 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-05 20:28:39,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions.
[2024-11-05 20:28:39,199 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 12
[2024-11-05 20:28:39,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 20:28:39,199 INFO  L471      AbstractCegarLoop]: Abstraction has 25 states and 31 transitions.
[2024-11-05 20:28:39,199 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-05 20:28:39,199 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions.
[2024-11-05 20:28:39,200 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-05 20:28:39,202 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:39,202 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:39,205 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-05 20:28:39,404 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-05 20:28:39,405 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:39,405 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:39,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -1786738894, now seen corresponding path program 2 times
[2024-11-05 20:28:39,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:39,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329210018]
[2024-11-05 20:28:39,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:39,406 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-05 20:28:39,406 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:39,409 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-05 20:28:39,411 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-05 20:28:39,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:39,448 INFO  L255         TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:39,450 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:39,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:39,588 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 20:28:39,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:39,807 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 20:28:39,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329210018]
[2024-11-05 20:28:39,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1329210018] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 20:28:39,808 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 20:28:39,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2024-11-05 20:28:39,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798000209]
[2024-11-05 20:28:39,808 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 20:28:39,809 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-05 20:28:39,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 20:28:39,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-05 20:28:39,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2024-11-05 20:28:39,812 INFO  L87              Difference]: Start difference. First operand 25 states and 31 transitions. Second operand  has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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-05 20:28:39,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 20:28:39,933 INFO  L93              Difference]: Finished difference Result 35 states and 44 transitions.
[2024-11-05 20:28:39,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-05 20:28:39,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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) Word has length 24
[2024-11-05 20:28:39,935 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 20:28:39,936 INFO  L225             Difference]: With dead ends: 35
[2024-11-05 20:28:39,936 INFO  L226             Difference]: Without dead ends: 31
[2024-11-05 20:28:39,936 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2024-11-05 20:28:39,937 INFO  L432           NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-05 20:28:39,937 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 164 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-05 20:28:39,939 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2024-11-05 20:28:39,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2024-11-05 20:28:39,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-05 20:28:39,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions.
[2024-11-05 20:28:39,944 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24
[2024-11-05 20:28:39,944 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 20:28:39,945 INFO  L471      AbstractCegarLoop]: Abstraction has 31 states and 39 transitions.
[2024-11-05 20:28:39,945 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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-05 20:28:39,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions.
[2024-11-05 20:28:39,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-05 20:28:39,946 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:39,946 INFO  L215           NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:39,950 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-05 20:28:40,148 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-05 20:28:40,149 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:40,150 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:40,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times
[2024-11-05 20:28:40,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:40,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112734961]
[2024-11-05 20:28:40,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:40,150 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-05 20:28:40,150 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:40,152 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-05 20:28:40,154 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-05 20:28:40,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:40,193 WARN  L253         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 36 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:40,196 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:41,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:41,891 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 20:28:44,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 84 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:44,918 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 20:28:44,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112734961]
[2024-11-05 20:28:44,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [2112734961] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 20:28:44,919 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 20:28:44,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51
[2024-11-05 20:28:44,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92328580]
[2024-11-05 20:28:44,919 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 20:28:44,920 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2024-11-05 20:28:44,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 20:28:44,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2024-11-05 20:28:44,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2110, Unknown=0, NotChecked=0, Total=2550
[2024-11-05 20:28:44,922 INFO  L87              Difference]: Start difference. First operand 31 states and 39 transitions. Second operand  has 51 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-05 20:28:45,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 20:28:45,632 INFO  L93              Difference]: Finished difference Result 72 states and 90 transitions.
[2024-11-05 20:28:45,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-11-05 20:28:45,633 INFO  L78                 Accepts]: Start accepts. Automaton has  has 51 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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 30
[2024-11-05 20:28:45,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 20:28:45,634 INFO  L225             Difference]: With dead ends: 72
[2024-11-05 20:28:45,634 INFO  L226             Difference]: Without dead ends: 59
[2024-11-05 20:28:45,636 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=513, Invalid=2349, Unknown=0, NotChecked=0, Total=2862
[2024-11-05 20:28:45,636 INFO  L432           NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-05 20:28:45,637 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-05 20:28:45,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2024-11-05 20:28:45,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52.
[2024-11-05 20:28:45,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 52 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 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-05 20:28:45,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions.
[2024-11-05 20:28:45,652 INFO  L78                 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 30
[2024-11-05 20:28:45,652 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 20:28:45,652 INFO  L471      AbstractCegarLoop]: Abstraction has 52 states and 66 transitions.
[2024-11-05 20:28:45,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-05 20:28:45,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions.
[2024-11-05 20:28:45,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-05 20:28:45,657 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 20:28:45,658 INFO  L215           NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1]
[2024-11-05 20:28:45,662 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-05 20:28:45,860 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-05 20:28:45,861 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 20:28:45,861 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 20:28:45,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -1777786732, now seen corresponding path program 1 times
[2024-11-05 20:28:45,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 20:28:45,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134730952]
[2024-11-05 20:28:45,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 20:28:45,862 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 20:28:45,862 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 20:28:45,863 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-05 20:28:45,864 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-05 20:28:45,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 20:28:45,887 WARN  L253         TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 37 conjuncts are in the unsatisfiable core
[2024-11-05 20:28:45,889 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 20:28:46,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 20:28:46,870 INFO  L311         TraceCheckSpWp]: Computing backward predicates...