/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c


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


This is Ultimate 0.2.5-dev-b75d321-m
[2024-11-05 09:24:19,106 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-05 09:24:19,162 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2024-11-05 09:24:19,166 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-05 09:24:19,167 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-05 09:24:19,203 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-05 09:24:19,204 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-05 09:24:19,204 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-05 09:24:19,205 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-05 09:24:19,205 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-05 09:24:19,205 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-05 09:24:19,206 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-05 09:24:19,206 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-05 09:24:19,207 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-05 09:24:19,207 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-05 09:24:19,208 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-05 09:24:19,209 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-05 09:24:19,210 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-05 09:24:19,210 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-05 09:24:19,211 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-05 09:24:19,211 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-05 09:24:19,214 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-05 09:24:19,214 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-05 09:24:19,214 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-05 09:24:19,214 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-05 09:24:19,215 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-05 09:24:19,215 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-05 09:24:19,215 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-05 09:24:19,215 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-05 09:24:19,215 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-05 09:24:19,216 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-05 09:24:19,216 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 09:24:19,216 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-05 09:24:19,216 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-05 09:24:19,216 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-05 09:24:19,217 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-05 09:24:19,217 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt 
[2024-11-05 09:24:19,217 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-05 09:24:19,218 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-05 09:24:19,218 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-05 09:24:19,218 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-05 09:24:19,219 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:19,436 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-05 09:24:19,458 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-05 09:24:19,460 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-05 09:24:19,461 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-05 09:24:19,462 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-05 09:24:19,463 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c
[2024-11-05 09:24:20,904 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-05 09:24:21,097 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-05 09:24:21,098 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c
[2024-11-05 09:24:21,109 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ed61cfc/cac89c8413a64083abadeb1247f21309/FLAG50d40dca5
[2024-11-05 09:24:21,131 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ed61cfc/cac89c8413a64083abadeb1247f21309
[2024-11-05 09:24:21,135 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-05 09:24:21,137 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-05 09:24:21,140 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-05 09:24:21,140 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-05 09:24:21,145 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-05 09:24:21,146 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,147 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8134623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21, skipping insertion in model container
[2024-11-05 09:24:21,147 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,175 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-05 09:24:21,345 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262]
[2024-11-05 09:24:21,408 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 09:24:21,418 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-05 09:24:21,428 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262]
[2024-11-05 09:24:21,461 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-05 09:24:21,477 INFO  L204         MainTranslator]: Completed translation
[2024-11-05 09:24:21,477 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21 WrapperNode
[2024-11-05 09:24:21,477 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-05 09:24:21,478 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-05 09:24:21,479 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-05 09:24:21,479 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-05 09:24:21,489 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,499 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,524 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 250
[2024-11-05 09:24:21,524 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-05 09:24:21,525 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-05 09:24:21,527 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-05 09:24:21,527 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-05 09:24:21,537 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,538 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,543 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,560 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-05 09:24:21,561 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,562 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,574 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,579 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,581 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,582 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,586 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-05 09:24:21,587 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-05 09:24:21,587 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-05 09:24:21,587 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-05 09:24:21,588 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (1/1) ...
[2024-11-05 09:24:21,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-05 09:24:21,602 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-05 09:24:21,616 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-05 09:24:21,619 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-05 09:24:21,640 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-05 09:24:21,640 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-05 09:24:21,640 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-05 09:24:21,640 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-05 09:24:21,736 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-05 09:24:21,738 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-05 09:24:22,038 INFO  L?                        ?]: Removed 36 outVars from TransFormulas that were not future-live.
[2024-11-05 09:24:22,038 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-05 09:24:22,050 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-05 09:24:22,052 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-05 09:24:22,052 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:24:22 BoogieIcfgContainer
[2024-11-05 09:24:22,053 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-05 09:24:22,055 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-05 09:24:22,056 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-05 09:24:22,060 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-05 09:24:22,060 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:24:21" (1/3) ...
[2024-11-05 09:24:22,061 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb3d4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:24:22, skipping insertion in model container
[2024-11-05 09:24:22,061 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:24:21" (2/3) ...
[2024-11-05 09:24:22,061 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb3d4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:24:22, skipping insertion in model container
[2024-11-05 09:24:22,061 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:24:22" (3/3) ...
[2024-11-05 09:24:22,063 INFO  L112   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c
[2024-11-05 09:24:22,079 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-05 09:24:22,080 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-05 09:24:22,141 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-05 09:24:22,147 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;@728620d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-05 09:24:22,147 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-05 09:24:22,151 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:22,157 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-05 09:24:22,158 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 09:24:22,159 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-05 09:24:22,160 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 09:24:22,166 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 09:24:22,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times
[2024-11-05 09:24:22,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 09:24:22,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1717191353]
[2024-11-05 09:24:22,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 09:24:22,177 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:22,177 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 09:24:22,181 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-05 09:24:22,183 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-05 09:24:22,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 09:24:22,315 INFO  L255         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core
[2024-11-05 09:24:22,326 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 09:24:22,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:24:22,475 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 09:24:22,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:24:22,640 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 09:24:22,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1717191353]
[2024-11-05 09:24:22,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [1717191353] provided 2 perfect and 0 imperfect interpolant sequences
[2024-11-05 09:24:22,642 INFO  L185   FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences.
[2024-11-05 09:24:22,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6
[2024-11-05 09:24:22,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846149432]
[2024-11-05 09:24:22,644 INFO  L85    oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton
[2024-11-05 09:24:22,649 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-05 09:24:22,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 09:24:22,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-05 09:24:22,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-05 09:24:22,676 INFO  L87              Difference]: Start difference. First operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:22,724 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 09:24:22,724 INFO  L93              Difference]: Finished difference Result 17 states and 22 transitions.
[2024-11-05 09:24:22,726 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-05 09:24:22,727 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-05 09:24:22,727 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 09:24:22,734 INFO  L225             Difference]: With dead ends: 17
[2024-11-05 09:24:22,734 INFO  L226             Difference]: Without dead ends: 9
[2024-11-05 09:24:22,737 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-05 09:24:22,743 INFO  L432           NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-05 09:24:22,744 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-05 09:24:22,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-05 09:24:22,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-05 09:24:22,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:22,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-05 09:24:22,774 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2024-11-05 09:24:22,774 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 09:24:22,774 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-05 09:24:22,774 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:22,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-05 09:24:22,775 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-05 09:24:22,775 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 09:24:22,775 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-05 09:24:22,783 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-05 09:24:22,979 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:22,980 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 09:24:22,981 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 09:24:22,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times
[2024-11-05 09:24:22,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 09:24:22,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228400849]
[2024-11-05 09:24:22,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 09:24:22,982 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:22,982 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 09:24:22,983 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-05 09:24:22,984 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-05 09:24:23,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 09:24:23,091 INFO  L255         TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-05 09:24:23,097 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 09:24:23,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:24:23,309 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 09:24:28,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:24:28,207 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 09:24:28,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228400849]
[2024-11-05 09:24:28,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [228400849] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 09:24:28,210 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 09:24:28,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-05 09:24:28,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387783595]
[2024-11-05 09:24:28,210 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 09:24:28,212 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-05 09:24:28,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 09:24:28,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-05 09:24:28,213 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56
[2024-11-05 09:24:28,213 INFO  L87              Difference]: Start difference. First operand 9 states and 9 transitions. Second operand  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:28,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 09:24:28,800 INFO  L93              Difference]: Finished difference Result 14 states and 14 transitions.
[2024-11-05 09:24:28,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-05 09:24:28,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-05 09:24:28,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 09:24:28,801 INFO  L225             Difference]: With dead ends: 14
[2024-11-05 09:24:28,801 INFO  L226             Difference]: Without dead ends: 12
[2024-11-05 09:24:28,802 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90
[2024-11-05 09:24:28,803 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-05 09:24:28,803 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-05 09:24:28,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12 states.
[2024-11-05 09:24:28,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2024-11-05 09:24:28,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:28,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2024-11-05 09:24:28,806 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8
[2024-11-05 09:24:28,807 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 09:24:28,807 INFO  L471      AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2024-11-05 09:24:28,807 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:28,807 INFO  L276                IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2024-11-05 09:24:28,807 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-05 09:24:28,807 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 09:24:28,808 INFO  L215           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-11-05 09:24:28,812 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-05 09:24:29,010 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:29,011 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 09:24:29,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 09:24:29,012 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times
[2024-11-05 09:24:29,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 09:24:29,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980274340]
[2024-11-05 09:24:29,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 09:24:29,012 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:29,012 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 09:24:29,015 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-05 09:24:29,016 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-05 09:24:29,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 09:24:29,138 INFO  L255         TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-05 09:24:29,143 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 09:24:31,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:24:31,538 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-05 09:24:45,346 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse6 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse13 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_29~0#1|)) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|))))) (let ((.cse7 (bvneg .cse3)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse9 (not .cse0)) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse12 (not .cse13)) (.cse17 (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) .cse19))) (.cse18 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8)))) (and .cse6 (or (not .cse18) (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse19)))))))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))))) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse19 (_ bv2 32)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))))) .cse18 .cse1)))))) (and (or (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse10) .cse11))))))))) (and (or .cse0 .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse3))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4))))))) .cse6 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse7))))))) .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse8)))))) .cse9 .cse1))) .cse12) (or .cse13 (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))))))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse3))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse15)))))) .cse1) .cse6 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse7))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse16)))))) .cse9 .cse1)))) (or .cse12 .cse17) (or .cse13 .cse17))))) is different from false
[2024-11-05 09:24:49,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2024-11-05 09:24:49,451 INFO  L136   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace
[2024-11-05 09:24:49,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980274340]
[2024-11-05 09:24:49,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModulePreferences [980274340] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-05 09:24:49,451 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-05 09:24:49,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2024-11-05 09:24:49,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6050283]
[2024-11-05 09:24:49,452 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-05 09:24:49,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-05 09:24:49,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2024-11-05 09:24:49,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-05 09:24:49,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90
[2024-11-05 09:24:49,457 INFO  L87              Difference]: Start difference. First operand 12 states and 12 transitions. Second operand  has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:56,100 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-05 09:24:56,100 INFO  L93              Difference]: Finished difference Result 17 states and 17 transitions.
[2024-11-05 09:24:56,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-05 09:24:56,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2024-11-05 09:24:56,101 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-05 09:24:56,102 INFO  L225             Difference]: With dead ends: 17
[2024-11-05 09:24:56,102 INFO  L226             Difference]: Without dead ends: 15
[2024-11-05 09:24:56,102 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210
[2024-11-05 09:24:56,103 INFO  L432           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-05 09:24:56,103 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 8 Unchecked, 0.7s Time]
[2024-11-05 09:24:56,104 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2024-11-05 09:24:56,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2024-11-05 09:24:56,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:56,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2024-11-05 09:24:56,108 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11
[2024-11-05 09:24:56,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-05 09:24:56,109 INFO  L471      AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-05 09:24:56,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-05 09:24:56,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2024-11-05 09:24:56,109 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-05 09:24:56,109 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-05 09:24:56,109 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1]
[2024-11-05 09:24:56,113 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-05 09:24:56,310 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:56,311 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-05 09:24:56,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-05 09:24:56,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times
[2024-11-05 09:24:56,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2024-11-05 09:24:56,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036287808]
[2024-11-05 09:24:56,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-05 09:24:56,312 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-05 09:24:56,313 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-05 09:24:56,318 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-05 09:24:56,319 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-05 09:24:56,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-05 09:24:56,540 INFO  L255         TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-05 09:24:56,546 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-05 09:25:43,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-05 09:25:43,412 INFO  L311         TraceCheckSpWp]: Computing backward predicates...