/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/hardness-nfm22/hardness_operatoramount_amount50_file-72.i


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:04:55,553 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:04:55,640 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:04:55,645 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:04:55,645 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:04:55,669 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:04:55,670 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:04:55,670 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:04:55,671 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:04:55,673 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:04:55,673 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:04:55,674 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:04:55,674 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:04:55,679 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:04:55,680 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:04:55,680 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:04:55,680 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:04:55,681 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:04:55,681 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:04:55,681 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:04:55,681 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:04:55,682 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:04:55,682 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:04:55,682 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:04:55,683 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:04:55,683 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:04:55,683 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:04:55,683 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:04:55,683 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:04:55,684 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:04:55,684 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:04:55,684 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:04:55,685 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:04:55,685 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:04:55,685 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:04:55,685 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:04:55,686 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:04:55,686 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:04:55,686 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:04:55,686 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:04:55,687 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:04:55,687 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:04:55,687 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:04:55,688 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:04:55,688 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:04:55,931 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:04:55,956 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:04:55,959 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:04:55,960 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:04:55,960 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:04:55,962 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-72.i
[2024-11-06 00:04:57,445 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:04:57,679 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:04:57,679 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-72.i
[2024-11-06 00:04:57,691 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72360dc2/e2a59c78ef9d4ef3929df49cc0541627/FLAG090f5ee97
[2024-11-06 00:04:57,708 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72360dc2/e2a59c78ef9d4ef3929df49cc0541627
[2024-11-06 00:04:57,711 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:04:57,713 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:04:57,717 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:04:57,717 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:04:57,723 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:04:57,723 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:04:57" (1/1) ...
[2024-11-06 00:04:57,724 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326041da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:57, skipping insertion in model container
[2024-11-06 00:04:57,725 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:04:57" (1/1) ...
[2024-11-06 00:04:57,759 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:04:57,933 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-72.i[915,928]
[2024-11-06 00:04:57,989 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:04:58,003 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:04:58,014 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-72.i[915,928]
[2024-11-06 00:04:58,040 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:04:58,060 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:04:58,061 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58 WrapperNode
[2024-11-06 00:04:58,061 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:04:58,062 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:04:58,062 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:04:58,062 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:04:58,070 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:04:58" (1/1) ...
[2024-11-06 00:04:58,088 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:04:58" (1/1) ...
[2024-11-06 00:04:58,113 INFO  L138                Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134
[2024-11-06 00:04:58,114 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:04:58,115 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:04:58,115 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:04:58,115 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:04:58,126 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,126 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,131 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,162 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:04:58,162 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,162 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,171 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,174 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,177 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,178 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,182 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:04:58,183 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:04:58,183 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:04:58,183 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:04:58,184 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (1/1) ...
[2024-11-06 00:04:58,190 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:04:58,205 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:04:58,223 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:04:58,226 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:04:58,258 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:04:58,258 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:04:58,259 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-06 00:04:58,259 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-06 00:04:58,259 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:04:58,259 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:04:58,364 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:04:58,367 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:05:08,603 INFO  L?                        ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-06 00:05:08,604 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:05:08,622 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:05:08,623 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 00:05:08,623 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:05:08 BoogieIcfgContainer
[2024-11-06 00:05:08,623 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:05:08,627 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:05:08,628 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:05:08,631 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:05:08,631 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:04:57" (1/3) ...
[2024-11-06 00:05:08,633 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3534960a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:05:08, skipping insertion in model container
[2024-11-06 00:05:08,633 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:04:58" (2/3) ...
[2024-11-06 00:05:08,633 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3534960a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:05:08, skipping insertion in model container
[2024-11-06 00:05:08,633 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:05:08" (3/3) ...
[2024-11-06 00:05:08,635 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-72.i
[2024-11-06 00:05:08,654 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:05:08,654 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:05:08,723 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:05:08,729 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;@8c2c16b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:05:08,730 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:05:08,733 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2024-11-06 00:05:08,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-06 00:05:08,743 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:05:08,744 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:05:08,745 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:05:08,749 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:05:08,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -268082041, now seen corresponding path program 1 times
[2024-11-06 00:05:08,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:05:08,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213434611]
[2024-11-06 00:05:08,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:05:08,761 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:05:08,761 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:05:08,763 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:05:08,764 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:05:09,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:05:09,320 INFO  L255         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-06 00:05:09,329 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:05:09,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked.
[2024-11-06 00:05:09,379 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:05:09,381 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:05:09,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213434611]
[2024-11-06 00:05:09,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [213434611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:05:09,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:05:09,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 00:05:09,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233470371]
[2024-11-06 00:05:09,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:05:09,388 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-06 00:05:09,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:05:09,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-06 00:05:09,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 00:05:09,408 INFO  L87              Difference]: Start difference. First operand  has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand  has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-06 00:05:09,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:05:09,433 INFO  L93              Difference]: Finished difference Result 109 states and 183 transitions.
[2024-11-06 00:05:09,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-06 00:05:09,435 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112
[2024-11-06 00:05:09,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:05:09,442 INFO  L225             Difference]: With dead ends: 109
[2024-11-06 00:05:09,442 INFO  L226             Difference]: Without dead ends: 54
[2024-11-06 00:05:09,447 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 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-06 00:05:09,450 INFO  L432           NwaCegarLoop]: 78 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, 78 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-06 00:05:09,452 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 00:05:09,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-06 00:05:09,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2024-11-06 00:05:09,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2024-11-06 00:05:09,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions.
[2024-11-06 00:05:09,512 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 112
[2024-11-06 00:05:09,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:05:09,512 INFO  L471      AbstractCegarLoop]: Abstraction has 54 states and 78 transitions.
[2024-11-06 00:05:09,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)
[2024-11-06 00:05:09,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions.
[2024-11-06 00:05:09,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-06 00:05:09,517 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:05:09,518 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:05:09,541 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 (2)] Forceful destruction successful, exit code 0
[2024-11-06 00:05:09,723 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:05:09,724 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:05:09,725 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:05:09,725 INFO  L85        PathProgramCache]: Analyzing trace with hash -2036138026, now seen corresponding path program 1 times
[2024-11-06 00:05:09,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:05:09,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313836450]
[2024-11-06 00:05:09,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:05:09,726 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:05:09,727 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:05:09,728 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:05:09,731 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-06 00:05:10,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:05:10,175 INFO  L255         TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-06 00:05:10,181 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:05:13,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2024-11-06 00:05:13,908 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:05:13,909 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:05:13,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313836450]
[2024-11-06 00:05:13,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [313836450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:05:13,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:05:13,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:05:13,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293154440]
[2024-11-06 00:05:13,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:05:13,911 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:05:13,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:05:13,914 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:05:13,914 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:05:13,915 INFO  L87              Difference]: Start difference. First operand 54 states and 78 transitions. Second operand  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:05:18,441 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:22,446 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:26,745 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:29,422 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:29,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:05:29,423 INFO  L93              Difference]: Finished difference Result 157 states and 229 transitions.
[2024-11-06 00:05:29,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:05:29,482 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113
[2024-11-06 00:05:29,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:05:29,485 INFO  L225             Difference]: With dead ends: 157
[2024-11-06 00:05:29,486 INFO  L226             Difference]: Without dead ends: 106
[2024-11-06 00:05:29,487 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:05:29,489 INFO  L432           NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time
[2024-11-06 00:05:29,489 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 210 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time]
[2024-11-06 00:05:29,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-06 00:05:29,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88.
[2024-11-06 00:05:29,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-06 00:05:29,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions.
[2024-11-06 00:05:29,522 INFO  L78                 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 113
[2024-11-06 00:05:29,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:05:29,523 INFO  L471      AbstractCegarLoop]: Abstraction has 88 states and 128 transitions.
[2024-11-06 00:05:29,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:05:29,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions.
[2024-11-06 00:05:29,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-06 00:05:29,525 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:05:29,525 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:05:29,546 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:05:29,726 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:05:29,727 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:05:29,728 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:05:29,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -1449332012, now seen corresponding path program 1 times
[2024-11-06 00:05:29,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:05:29,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121113725]
[2024-11-06 00:05:29,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:05:29,729 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-06 00:05:29,729 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:05:29,732 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:05:29,733 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:05:30,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:05:30,175 INFO  L255         TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-06 00:05:30,180 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:05:33,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2024-11-06 00:05:33,746 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:05:33,746 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:05:33,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121113725]
[2024-11-06 00:05:33,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121113725] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:05:33,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:05:33,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:05:33,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016760444]
[2024-11-06 00:05:33,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:05:33,750 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:05:33,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:05:33,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:05:33,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:05:33,753 INFO  L87              Difference]: Start difference. First operand 88 states and 128 transitions. Second operand  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:05:38,239 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:42,244 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:46,499 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:50,469 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:05:50,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:05:50,470 INFO  L93              Difference]: Finished difference Result 157 states and 228 transitions.
[2024-11-06 00:05:50,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:05:50,521 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113
[2024-11-06 00:05:50,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:05:50,524 INFO  L225             Difference]: With dead ends: 157
[2024-11-06 00:05:50,524 INFO  L226             Difference]: Without dead ends: 106
[2024-11-06 00:05:50,525 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:05:50,526 INFO  L432           NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time
[2024-11-06 00:05:50,527 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 212 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time]
[2024-11-06 00:05:50,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-06 00:05:50,551 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89.
[2024-11-06 00:05:50,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-06 00:05:50,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions.
[2024-11-06 00:05:50,553 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 113
[2024-11-06 00:05:50,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:05:50,554 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 129 transitions.
[2024-11-06 00:05:50,554 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:05:50,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions.
[2024-11-06 00:05:50,556 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-11-06 00:05:50,556 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:05:50,556 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:05:50,578 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:05:50,760 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:05:50,761 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:05:50,762 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:05:50,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -1458176075, now seen corresponding path program 1 times
[2024-11-06 00:05:50,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:05:50,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57648653]
[2024-11-06 00:05:50,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:05:50,763 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:05:50,763 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:05:50,766 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:05:50,767 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:05:51,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:05:51,232 INFO  L255         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-06 00:05:51,236 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:05:52,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2024-11-06 00:05:52,791 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:05:52,791 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:05:52,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57648653]
[2024-11-06 00:05:52,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [57648653] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:05:52,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:05:52,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:05:52,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416372857]
[2024-11-06 00:05:52,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:05:52,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:05:52,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:05:52,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:05:52,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 00:05:52,794 INFO  L87              Difference]: Start difference. First operand 89 states and 129 transitions. Second operand  has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:05:57,110 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:06:01,121 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:06:05,321 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 []
[2024-11-06 00:06:09,325 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:06:09,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:06:09,326 INFO  L93              Difference]: Finished difference Result 157 states and 227 transitions.
[2024-11-06 00:06:09,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:06:09,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114
[2024-11-06 00:06:09,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:06:09,379 INFO  L225             Difference]: With dead ends: 157
[2024-11-06 00:06:09,380 INFO  L226             Difference]: Without dead ends: 106
[2024-11-06 00:06:09,381 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-06 00:06:09,382 INFO  L432           NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 35 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time
[2024-11-06 00:06:09,382 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time]
[2024-11-06 00:06:09,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-06 00:06:09,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90.
[2024-11-06 00:06:09,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-06 00:06:09,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions.
[2024-11-06 00:06:09,414 INFO  L78                 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 114
[2024-11-06 00:06:09,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:06:09,415 INFO  L471      AbstractCegarLoop]: Abstraction has 90 states and 130 transitions.
[2024-11-06 00:06:09,415 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)
[2024-11-06 00:06:09,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions.
[2024-11-06 00:06:09,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-06 00:06:09,421 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:06:09,421 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:06:09,443 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-06 00:06:09,622 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:06:09,623 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:06:09,623 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:06:09,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 556274447, now seen corresponding path program 1 times
[2024-11-06 00:06:09,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:06:09,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774517270]
[2024-11-06 00:06:09,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:06:09,624 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:06:09,625 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:06:09,626 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:06:09,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 (6)] Waiting until timeout for monitored process
[2024-11-06 00:06:10,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:06:10,058 INFO  L255         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:06:10,062 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:06:11,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked.
[2024-11-06 00:06:11,078 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 00:06:12,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked.
[2024-11-06 00:06:12,161 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:06:12,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774517270]
[2024-11-06 00:06:12,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774517270] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-06 00:06:12,161 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 00:06:12,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-06 00:06:12,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400583506]
[2024-11-06 00:06:12,162 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 00:06:12,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-06 00:06:12,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:06:12,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-06 00:06:12,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-06 00:06:12,164 INFO  L87              Difference]: Start difference. First operand 90 states and 130 transitions. Second operand  has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-11-06 00:06:16,532 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:06:16,918 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:06:16,918 INFO  L93              Difference]: Finished difference Result 153 states and 215 transitions.
[2024-11-06 00:06:16,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-06 00:06:16,919 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 115
[2024-11-06 00:06:16,919 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:06:16,921 INFO  L225             Difference]: With dead ends: 153
[2024-11-06 00:06:16,921 INFO  L226             Difference]: Without dead ends: 102
[2024-11-06 00:06:16,922 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90
[2024-11-06 00:06:16,923 INFO  L432           NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2024-11-06 00:06:16,924 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 164 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2024-11-06 00:06:16,925 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2024-11-06 00:06:16,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98.
[2024-11-06 00:06:16,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-06 00:06:16,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions.
[2024-11-06 00:06:16,960 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 115
[2024-11-06 00:06:16,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:06:16,961 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 135 transitions.
[2024-11-06 00:06:16,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-11-06 00:06:16,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions.
[2024-11-06 00:06:16,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-06 00:06:16,963 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:06:16,963 INFO  L215           NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 00:06:16,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 (6)] Ended with exit code 0
[2024-11-06 00:06:17,164 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:06:17,164 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:06:17,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:06:17,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 163247437, now seen corresponding path program 1 times
[2024-11-06 00:06:17,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:06:17,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977117380]
[2024-11-06 00:06:17,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:06:17,166 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:06:17,166 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:06:17,167 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:06:17,169 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:06:17,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:06:17,586 INFO  L255         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjuncts are in the unsatisfiable core
[2024-11-06 00:06:17,592 INFO  L278         TraceCheckSpWp]: Computing forward predicates...