/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 FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-8.i


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


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 08:40:51,378 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 08:40:51,442 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 08:40:51,447 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 08:40:51,447 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 08:40:51,471 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 08:40:51,472 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 08:40:51,472 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 08:40:51,473 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 08:40:51,475 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 08:40:51,476 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 08:40:51,476 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 08:40:51,476 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 08:40:51,476 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 08:40:51,477 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 08:40:51,477 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 08:40:51,477 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 08:40:51,477 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 08:40:51,478 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 08:40:51,478 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 08:40:51,478 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 08:40:51,480 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 08:40:51,480 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 08:40:51,480 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 08:40:51,481 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 08:40:51,482 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 08:40:51,482 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 08:40:51,482 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 08:40:51,482 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 08:40:51,482 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 08:40:51,483 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 08:40:51,483 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 08:40:51,483 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 08:40:51,483 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 08:40:51,483 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 08:40:51,483 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 08:40:51,484 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 08:40:51,484 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 08:40:51,484 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 08:40:51,485 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 -> FOX
[2024-11-06 08:40:51,664 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 08:40:51,687 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 08:40:51,689 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 08:40:51,689 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 08:40:51,690 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 08:40:51,691 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-8.i
[2024-11-06 08:40:52,928 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 08:40:53,068 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 08:40:53,068 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-8.i
[2024-11-06 08:40:53,074 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3b36d84/17350c6a94ff4cc28808e7fde418fab0/FLAG6ba607ed6
[2024-11-06 08:40:53,489 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae3b36d84/17350c6a94ff4cc28808e7fde418fab0
[2024-11-06 08:40:53,491 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 08:40:53,492 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 08:40:53,495 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 08:40:53,495 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 08:40:53,499 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 08:40:53,499 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,500 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4917ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53, skipping insertion in model container
[2024-11-06 08:40:53,500 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,519 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 08:40:53,638 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_amount25_file-8.i[914,927]
[2024-11-06 08:40:53,687 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 08:40:53,697 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 08:40:53,706 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_amount25_file-8.i[914,927]
[2024-11-06 08:40:53,718 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 08:40:53,733 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 08:40:53,734 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53 WrapperNode
[2024-11-06 08:40:53,734 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 08:40:53,735 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 08:40:53,735 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 08:40:53,736 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 08:40:53,744 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,752 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,769 INFO  L138                Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116
[2024-11-06 08:40:53,769 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 08:40:53,772 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 08:40:53,772 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 08:40:53,772 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 08:40:53,782 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,782 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,784 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,794 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 08:40:53,794 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,794 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,799 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,801 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,802 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,803 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,808 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 08:40:53,808 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 08:40:53,808 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 08:40:53,808 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 08:40:53,809 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (1/1) ...
[2024-11-06 08:40:53,814 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 08:40:53,822 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 08:40:53,835 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 08:40:53,844 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 08:40:53,864 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 08:40:53,864 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 08:40:53,864 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-06 08:40:53,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-06 08:40:53,864 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 08:40:53,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 08:40:53,938 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 08:40:53,940 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 08:40:55,155 INFO  L?                        ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-06 08:40:55,156 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 08:40:55,167 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 08:40:55,168 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 08:40:55,168 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:40:55 BoogieIcfgContainer
[2024-11-06 08:40:55,168 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 08:40:55,170 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 08:40:55,170 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 08:40:55,172 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 08:40:55,173 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:40:53" (1/3) ...
[2024-11-06 08:40:55,174 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a922d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:40:55, skipping insertion in model container
[2024-11-06 08:40:55,174 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:40:53" (2/3) ...
[2024-11-06 08:40:55,174 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a922d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:40:55, skipping insertion in model container
[2024-11-06 08:40:55,174 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:40:55" (3/3) ...
[2024-11-06 08:40:55,175 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-8.i
[2024-11-06 08:40:55,191 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 08:40:55,192 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 08:40:55,231 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 08:40:55,235 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;@30030859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 08:40:55,235 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 08:40:55,238 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-06 08:40:55,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-06 08:40:55,246 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 08:40:55,247 INFO  L215           NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1]
[2024-11-06 08:40:55,247 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 08:40:55,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 08:40:55,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times
[2024-11-06 08:40:55,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-06 08:40:55,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411088223]
[2024-11-06 08:40:55,263 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 08:40:55,263 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 08:40:55,264 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 08:40:55,265 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 08:40:55,266 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 08:40:55,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 08:40:55,478 INFO  L255         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-06 08:40:55,487 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 08:40:55,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2024-11-06 08:40:55,528 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 08:40:55,528 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-06 08:40:55,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411088223]
[2024-11-06 08:40:55,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [411088223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 08:40:55,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 08:40:55,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 08:40:55,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947930827]
[2024-11-06 08:40:55,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 08:40:55,535 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-06 08:40:55,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-06 08:40:55,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-06 08:40:55,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-06 08:40:55,552 INFO  L87              Difference]: Start difference. First operand  has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-06 08:40:55,571 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 08:40:55,571 INFO  L93              Difference]: Finished difference Result 103 states and 176 transitions.
[2024-11-06 08:40:55,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-06 08:40:55,572 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125
[2024-11-06 08:40:55,573 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 08:40:55,577 INFO  L225             Difference]: With dead ends: 103
[2024-11-06 08:40:55,577 INFO  L226             Difference]: Without dead ends: 51
[2024-11-06 08:40:55,579 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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 08:40:55,582 INFO  L432           NwaCegarLoop]: 74 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, 74 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 08:40:55,595 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-06 08:40:55,608 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-06 08:40:55,626 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-06 08:40:55,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-06 08:40:55,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions.
[2024-11-06 08:40:55,631 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125
[2024-11-06 08:40:55,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 08:40:55,632 INFO  L471      AbstractCegarLoop]: Abstraction has 51 states and 74 transitions.
[2024-11-06 08:40:55,632 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-06 08:40:55,634 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions.
[2024-11-06 08:40:55,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-06 08:40:55,637 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 08:40:55,637 INFO  L215           NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1]
[2024-11-06 08:40:55,646 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-06 08:40:55,838 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 08:40:55,838 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 08:40:55,839 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 08:40:55,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times
[2024-11-06 08:40:55,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-06 08:40:55,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195407241]
[2024-11-06 08:40:55,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 08:40:55,841 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 08:40:55,841 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 08:40:55,842 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 08:40:55,843 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 08:40:56,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 08:40:56,041 INFO  L255         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-06 08:40:56,047 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 08:40:56,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked.
[2024-11-06 08:40:56,327 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 08:40:56,327 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-06 08:40:56,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195407241]
[2024-11-06 08:40:56,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [195407241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 08:40:56,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 08:40:56,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 08:40:56,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034085924]
[2024-11-06 08:40:56,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 08:40:56,329 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 08:40:56,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-06 08:40:56,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 08:40:56,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-06 08:40:56,331 INFO  L87              Difference]: Start difference. First operand 51 states and 74 transitions. Second operand  has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-06 08:40:56,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 08:40:56,720 INFO  L93              Difference]: Finished difference Result 99 states and 145 transitions.
[2024-11-06 08:40:56,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-06 08:40:56,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125
[2024-11-06 08:40:56,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 08:40:56,733 INFO  L225             Difference]: With dead ends: 99
[2024-11-06 08:40:56,733 INFO  L226             Difference]: Without dead ends: 51
[2024-11-06 08:40:56,733 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-06 08:40:56,734 INFO  L432           NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 08:40:56,735 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 08:40:56,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-06 08:40:56,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-06 08:40:56,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-06 08:40:56,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-06 08:40:56,745 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125
[2024-11-06 08:40:56,746 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 08:40:56,746 INFO  L471      AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-06 08:40:56,746 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)
[2024-11-06 08:40:56,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-06 08:40:56,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-06 08:40:56,748 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 08:40:56,748 INFO  L215           NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1]
[2024-11-06 08:40:56,757 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-06 08:40:56,948 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 08:40:56,949 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 08:40:56,950 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 08:40:56,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times
[2024-11-06 08:40:56,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-06 08:40:56,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065162053]
[2024-11-06 08:40:56,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 08:40:56,951 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 08:40:56,951 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 08:40:56,953 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 08:40:56,954 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 08:40:57,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 08:40:57,123 INFO  L255         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 08:40:57,127 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 08:40:57,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2024-11-06 08:40:57,330 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 08:40:57,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked.
[2024-11-06 08:40:57,569 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-06 08:40:57,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065162053]
[2024-11-06 08:40:57,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065162053] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-06 08:40:57,570 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 08:40:57,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2024-11-06 08:40:57,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795290796]
[2024-11-06 08:40:57,570 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 08:40:57,571 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-06 08:40:57,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-06 08:40:57,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-06 08:40:57,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-06 08:40:57,572 INFO  L87              Difference]: Start difference. First operand 51 states and 73 transitions. Second operand  has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37)
[2024-11-06 08:40:58,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 08:40:58,321 INFO  L93              Difference]: Finished difference Result 107 states and 150 transitions.
[2024-11-06 08:40:58,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-06 08:40:58,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125
[2024-11-06 08:40:58,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 08:40:58,334 INFO  L225             Difference]: With dead ends: 107
[2024-11-06 08:40:58,334 INFO  L226             Difference]: Without dead ends: 59
[2024-11-06 08:40:58,335 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110
[2024-11-06 08:40:58,336 INFO  L432           NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-06 08:40:58,336 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-06 08:40:58,337 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2024-11-06 08:40:58,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55.
[2024-11-06 08:40:58,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-06 08:40:58,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions.
[2024-11-06 08:40:58,348 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125
[2024-11-06 08:40:58,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 08:40:58,350 INFO  L471      AbstractCegarLoop]: Abstraction has 55 states and 75 transitions.
[2024-11-06 08:40:58,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37)
[2024-11-06 08:40:58,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions.
[2024-11-06 08:40:58,354 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-06 08:40:58,354 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 08:40:58,354 INFO  L215           NwaCegarLoop]: trace histogram [20, 20, 20, 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, 1]
[2024-11-06 08:40:58,365 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-06 08:40:58,554 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 08:40:58,555 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 08:40:58,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 08:40:58,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times
[2024-11-06 08:40:58,556 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-06 08:40:58,556 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268175184]
[2024-11-06 08:40:58,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 08:40:58,556 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 08:40:58,557 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 08:40:58,559 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 08:40:58,560 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 08:40:58,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 08:40:58,800 INFO  L255         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjuncts are in the unsatisfiable core
[2024-11-06 08:40:58,805 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 08:41:21,074 WARN  L286               SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-06 08:41:42,845 WARN  L286               SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-06 08:42:26,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 760 backedges. 545 proven. 144 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2024-11-06 08:42:26,350 INFO  L311         TraceCheckSpWp]: Computing backward predicates...