./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version c4f91361
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-c4f9136-m
[2023-11-23 14:18:49,433 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-23 14:18:49,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-23 14:18:49,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-23 14:18:49,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-23 14:18:49,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-23 14:18:49,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-23 14:18:49,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-23 14:18:49,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-23 14:18:49,551 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-23 14:18:49,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-23 14:18:49,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-23 14:18:49,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-23 14:18:49,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-23 14:18:49,554 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-23 14:18:49,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-23 14:18:49,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-23 14:18:49,555 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-23 14:18:49,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-23 14:18:49,555 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-23 14:18:49,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-23 14:18:49,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-23 14:18:49,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-23 14:18:49,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-23 14:18:49,557 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-23 14:18:49,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-23 14:18:49,557 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-23 14:18:49,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-23 14:18:49,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-23 14:18:49,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-23 14:18:49,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-23 14:18:49,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:18:49,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-23 14:18:49,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-23 14:18:49,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-23 14:18:49,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-23 14:18:49,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-23 14:18:49,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-23 14:18:49,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-23 14:18:49,561 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-23 14:18:49,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-23 14:18:49,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-23 14:18:49,562 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: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
[2023-11-23 14:18:49,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-23 14:18:49,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-23 14:18:49,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-23 14:18:49,857 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-23 14:18:49,857 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-23 14:18:49,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:51,008 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-23 14:18:51,207 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-23 14:18:51,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:51,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a2fb1a5/603df43efa92444ca9ca519100a99424/FLAG5018ec303
[2023-11-23 14:18:51,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a2fb1a5/603df43efa92444ca9ca519100a99424
[2023-11-23 14:18:51,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-23 14:18:51,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-23 14:18:51,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-23 14:18:51,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-23 14:18:51,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-23 14:18:51,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef5f08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51, skipping insertion in model container
[2023-11-23 14:18:51,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,278 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-23 14:18:51,398 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2023-11-23 14:18:51,404 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:18:51,414 INFO L202 MainTranslator]: Completed pre-run
[2023-11-23 14:18:51,429 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2023-11-23 14:18:51,430 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:18:51,446 INFO L206 MainTranslator]: Completed translation
[2023-11-23 14:18:51,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51 WrapperNode
[2023-11-23 14:18:51,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-23 14:18:51,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-23 14:18:51,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-23 14:18:51,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-23 14:18:51,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,477 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28
[2023-11-23 14:18:51,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-23 14:18:51,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-23 14:18:51,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-23 14:18:51,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-23 14:18:51,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,492 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].
[2023-11-23 14:18:51,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-23 14:18:51,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-23 14:18:51,505 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-23 14:18:51,505 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-23 14:18:51,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (1/1) ...
[2023-11-23 14:18:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:18:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-23 14:18:51,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-23 14:18:51,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-23 14:18:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-23 14:18:51,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-23 14:18:51,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-23 14:18:51,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-23 14:18:51,659 INFO L241 CfgBuilder]: Building ICFG
[2023-11-23 14:18:51,661 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-23 14:18:51,791 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-23 14:18:51,822 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-23 14:18:51,823 INFO L309 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-23 14:18:51,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:51 BoogieIcfgContainer
[2023-11-23 14:18:51,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-23 14:18:51,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-23 14:18:51,826 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-23 14:18:51,829 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-23 14:18:51,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:51" (1/3) ...
[2023-11-23 14:18:51,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da1321a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:51, skipping insertion in model container
[2023-11-23 14:18:51,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:51" (2/3) ...
[2023-11-23 14:18:51,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1da1321a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:51, skipping insertion in model container
[2023-11-23 14:18:51,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:51" (3/3) ...
[2023-11-23 14:18:51,832 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:51,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-23 14:18:51,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-23 14:18:51,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-23 14:18:51,906 INFO L357 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, mHoare=true, 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;@4fd2bf94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-23 14:18:51,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-23 14:18:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) 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)
[2023-11-23 14:18:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2023-11-23 14:18:51,916 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:18:51,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2023-11-23 14:18:51,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:18:51,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:18:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1497591, now seen corresponding path program 1 times
[2023-11-23 14:18:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-23 14:18:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67508397]
[2023-11-23 14:18:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:18:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-23 14:18:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-23 14:18:52,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-23 14:18:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-23 14:18:52,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-23 14:18:52,065 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-23 14:18:52,068 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-23 14:18:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-23 14:18:52,074 INFO L445 BasicCegarLoop]: Path program histogram: [1]
[2023-11-23 14:18:52,078 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-23 14:18:52,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:18:52 BoogieIcfgContainer
[2023-11-23 14:18:52,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-23 14:18:52,099 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-23 14:18:52,099 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-23 14:18:52,099 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-23 14:18:52,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:51" (3/4) ...
[2023-11-23 14:18:52,102 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-23 14:18:52,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-23 14:18:52,104 INFO L158 Benchmark]: Toolchain (without parser) took 865.16ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 96.6MB in the beginning and 107.2MB in the end (delta: -10.6MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB.
[2023-11-23 14:18:52,105 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-23 14:18:52,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.50ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 96.4MB in the beginning and 133.2MB in the end (delta: -36.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB.
[2023-11-23 14:18:52,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.13ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 131.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-23 14:18:52,110 INFO L158 Benchmark]: Boogie Preprocessor took 26.45ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 130.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-23 14:18:52,112 INFO L158 Benchmark]: RCFGBuilder took 319.20ms. Allocated memory is still 169.9MB. Free memory was 130.5MB in the beginning and 120.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-11-23 14:18:52,112 INFO L158 Benchmark]: TraceAbstraction took 271.83ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 107.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-23 14:18:52,113 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 107.2MB in the end (delta: 261.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-23 14:18:52,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 208.50ms. Allocated memory was 125.8MB in the beginning and 169.9MB in the end (delta: 44.0MB). Free memory was 96.4MB in the beginning and 133.2MB in the end (delta: -36.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 27.13ms. Allocated memory is still 169.9MB. Free memory was 133.2MB in the beginning and 131.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 26.45ms. Allocated memory is still 169.9MB. Free memory was 131.8MB in the beginning and 130.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 319.20ms. Allocated memory is still 169.9MB. Free memory was 130.5MB in the beginning and 120.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 271.83ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 107.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Witness Printer took 3.84ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 107.2MB in the end (delta: 261.4kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10.
Possible FailurePath:
[L1] int __return_main;
[L9] double main__x = 1.0;
[L10] double main__x1 = main__x / 2.5;
VAL [__return_main=0, main__x=1]
[L12] COND FALSE !(main__x1 != main__x)
[L21] int __tmp_1;
[L22] __tmp_1 = main__x == 0
[L23] int __VERIFIER_assert__cond;
[L24] __VERIFIER_assert__cond = __tmp_1
VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__x=1]
[L25] COND TRUE __VERIFIER_assert__cond == 0
VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__x=1]
[L27] reach_error()
VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main__x=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-11-23 14:18:52,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-c4f9136-m
[2023-11-23 14:18:54,213 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-23 14:18:54,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2023-11-23 14:18:54,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-23 14:18:54,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-23 14:18:54,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-23 14:18:54,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-23 14:18:54,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-23 14:18:54,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-23 14:18:54,350 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-23 14:18:54,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-23 14:18:54,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-23 14:18:54,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-23 14:18:54,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-23 14:18:54,352 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-23 14:18:54,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-23 14:18:54,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-23 14:18:54,353 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-23 14:18:54,354 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-23 14:18:54,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-23 14:18:54,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-23 14:18:54,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-23 14:18:54,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-23 14:18:54,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-23 14:18:54,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-23 14:18:54,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-23 14:18:54,356 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-23 14:18:54,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-23 14:18:54,357 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-23 14:18:54,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-23 14:18:54,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-23 14:18:54,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-23 14:18:54,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-23 14:18:54,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:18:54,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-23 14:18:54,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-23 14:18:54,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-23 14:18:54,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-23 14:18:54,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-23 14:18:54,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-23 14:18:54,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-23 14:18:54,361 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-23 14:18:54,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-23 14:18:54,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-23 14:18:54,361 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-23 14:18:54,362 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: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf
[2023-11-23 14:18:54,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-23 14:18:54,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-23 14:18:54,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-23 14:18:54,659 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-23 14:18:54,660 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-23 14:18:54,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:55,945 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-23 14:18:56,129 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-23 14:18:56,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:56,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65f5d564/0a5c16fa5edd4c16808e51204366807e/FLAGe54f685d7
[2023-11-23 14:18:56,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65f5d564/0a5c16fa5edd4c16808e51204366807e
[2023-11-23 14:18:56,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-23 14:18:56,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-23 14:18:56,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-23 14:18:56,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-23 14:18:56,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-23 14:18:56,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c3f24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56, skipping insertion in model container
[2023-11-23 14:18:56,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,186 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-23 14:18:56,337 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2023-11-23 14:18:56,345 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:18:56,358 INFO L202 MainTranslator]: Completed pre-run
[2023-11-23 14:18:56,373 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683]
[2023-11-23 14:18:56,373 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:18:56,390 INFO L206 MainTranslator]: Completed translation
[2023-11-23 14:18:56,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56 WrapperNode
[2023-11-23 14:18:56,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-23 14:18:56,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-23 14:18:56,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-23 14:18:56,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-23 14:18:56,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,421 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29
[2023-11-23 14:18:56,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-23 14:18:56,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-23 14:18:56,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-23 14:18:56,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-23 14:18:56,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,456 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].
[2023-11-23 14:18:56,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-23 14:18:56,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-23 14:18:56,489 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-23 14:18:56,490 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-23 14:18:56,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (1/1) ...
[2023-11-23 14:18:56,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:18:56,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-23 14:18:56,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-23 14:18:56,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-23 14:18:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-23 14:18:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-23 14:18:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-23 14:18:56,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-11-23 14:18:56,620 INFO L241 CfgBuilder]: Building ICFG
[2023-11-23 14:18:56,622 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-23 14:18:58,209 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-23 14:18:58,231 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-23 14:18:58,231 INFO L309 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-23 14:18:58,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:58 BoogieIcfgContainer
[2023-11-23 14:18:58,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-23 14:18:58,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-23 14:18:58,234 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-23 14:18:58,237 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-23 14:18:58,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:56" (1/3) ...
[2023-11-23 14:18:58,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6eb0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:58, skipping insertion in model container
[2023-11-23 14:18:58,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:56" (2/3) ...
[2023-11-23 14:18:58,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6eb0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:58, skipping insertion in model container
[2023-11-23 14:18:58,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:58" (3/3) ...
[2023-11-23 14:18:58,239 INFO L112 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c
[2023-11-23 14:18:58,255 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-23 14:18:58,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-23 14:18:58,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-23 14:18:58,298 INFO L357 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, mHoare=true, 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;@5169933b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-23 14:18:58,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-23 14:18:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) 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)
[2023-11-23 14:18:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2023-11-23 14:18:58,306 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:18:58,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2023-11-23 14:18:58,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:18:58,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:18:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1497591, now seen corresponding path program 1 times
[2023-11-23 14:18:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:18:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286734899]
[2023-11-23 14:18:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:18:58,323 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
[2023-11-23 14:18:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:18:58,328 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)
[2023-11-23 14:18:58,341 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
[2023-11-23 14:18:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:18:58,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-23 14:18:58,521 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:18:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:18:59,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-23 14:18:59,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-23 14:18:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286734899]
[2023-11-23 14:18:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286734899] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-23 14:18:59,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-23 14:18:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-23 14:18:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510346871]
[2023-11-23 14:18:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-23 14:18:59,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-23 14:18:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-23 14:18:59,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-23 14:18:59,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-23 14:18:59,653 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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)
[2023-11-23 14:19:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:19:01,782 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions.
[2023-11-23 14:19:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-23 14:19:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4
[2023-11-23 14:19:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:19:01,805 INFO L225 Difference]: With dead ends: 13
[2023-11-23 14:19:01,805 INFO L226 Difference]: Without dead ends: 6
[2023-11-23 14:19:01,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-23 14:19:01,818 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2023-11-23 14:19:01,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2023-11-23 14:19:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states.
[2023-11-23 14:19:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6.
[2023-11-23 14:19:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-23 14:19:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions.
[2023-11-23 14:19:01,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4
[2023-11-23 14:19:01,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:19:01,845 INFO L495 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions.
[2023-11-23 14:19:01,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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)
[2023-11-23 14:19:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions.
[2023-11-23 14:19:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2023-11-23 14:19:01,846 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:19:01,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2023-11-23 14:19:01,854 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
[2023-11-23 14:19:02,053 WARN L477 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
[2023-11-23 14:19:02,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:19:02,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:19:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash 46362837, now seen corresponding path program 1 times
[2023-11-23 14:19:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:19:02,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74305814]
[2023-11-23 14:19:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:19:02,056 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
[2023-11-23 14:19:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:19:02,084 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)
[2023-11-23 14:19:02,085 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
[2023-11-23 14:19:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:19:02,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-23 14:19:02,352 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:19:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:19:05,188 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-23 14:19:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:19:14,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-23 14:19:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74305814]
[2023-11-23 14:19:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74305814] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-23 14:19:14,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-11-23 14:19:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5
[2023-11-23 14:19:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427622909]
[2023-11-23 14:19:14,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-11-23 14:19:14,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-23 14:19:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-23 14:19:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-23 14:19:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-23 14:19:14,512 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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)
[2023-11-23 14:19:26,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:28,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:30,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:32,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:34,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:36,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:37,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:19:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:19:37,589 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions.
[2023-11-23 14:19:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-23 14:19:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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
[2023-11-23 14:19:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:19:37,590 INFO L225 Difference]: With dead ends: 12
[2023-11-23 14:19:37,590 INFO L226 Difference]: Without dead ends: 9
[2023-11-23 14:19:37,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56
[2023-11-23 14:19:37,592 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time
[2023-11-23 14:19:37,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 14.9s Time]
[2023-11-23 14:19:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2023-11-23 14:19:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2023-11-23 14:19:37,594 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)
[2023-11-23 14:19:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2023-11-23 14:19:37,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2023-11-23 14:19:37,595 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:19:37,595 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2023-11-23 14:19:37,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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)
[2023-11-23 14:19:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2023-11-23 14:19:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-11-23 14:19:37,596 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:19:37,596 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1]
[2023-11-23 14:19:37,639 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
[2023-11-23 14:19:37,796 WARN L477 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
[2023-11-23 14:19:37,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:19:37,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:19:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1846238857, now seen corresponding path program 2 times
[2023-11-23 14:19:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:19:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388887737]
[2023-11-23 14:19:37,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-23 14:19:37,799 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
[2023-11-23 14:19:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:19:37,800 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)
[2023-11-23 14:19:37,801 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
[2023-11-23 14:19:38,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-23 14:19:38,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-23 14:19:38,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjunts are in the unsatisfiable core
[2023-11-23 14:19:38,511 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:19:52,954 WARN L876 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2023-11-23 14:20:21,004 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:20:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-11-23 14:20:21,064 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-23 14:20:58,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false
[2023-11-23 14:21:10,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false
[2023-11-23 14:21:12,574 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true
[2023-11-23 14:21:23,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false
[2023-11-23 14:21:26,093 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true
[2023-11-23 14:21:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked.
[2023-11-23 14:21:26,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-23 14:21:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388887737]
[2023-11-23 14:21:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388887737] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-23 14:21:26,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-11-23 14:21:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12
[2023-11-23 14:21:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471137751]
[2023-11-23 14:21:26,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-11-23 14:21:26,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2023-11-23 14:21:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-23 14:21:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2023-11-23 14:21:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=33, Unknown=17, NotChecked=80, Total=156
[2023-11-23 14:21:26,103 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-23 14:21:28,481 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse2) .cse2) .cse2))) (or (fp.eq .cse1 .cse0) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:21:30,661 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse2) .cse2))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse2) .cse1)) (fp.eq .cse1 .cse0))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse2) .cse2) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:21:32,800 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:21:33,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:37,977 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)) (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:21:39,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:41,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:43,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:45,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:47,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:21:50,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:22:06,653 WARN L293 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2023-11-23 14:22:08,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:22:10,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:22:11,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:22:13,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:22:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:22:14,131 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions.
[2023-11-23 14:22:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-23 14:22:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2023-11-23 14:22:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:22:14,133 INFO L225 Difference]: With dead ends: 15
[2023-11-23 14:22:14,133 INFO L226 Difference]: Without dead ends: 11
[2023-11-23 14:22:14,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.1s TimeCoverageRelationStatistics Valid=39, Invalid=46, Unknown=23, NotChecked=198, Total=306
[2023-11-23 14:22:14,134 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time
[2023-11-23 14:22:14,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 8 Unknown, 76 Unchecked, 22.2s Time]
[2023-11-23 14:22:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2023-11-23 14:22:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2023-11-23 14:22:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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)
[2023-11-23 14:22:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions.
[2023-11-23 14:22:14,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8
[2023-11-23 14:22:14,137 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:22:14,137 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions.
[2023-11-23 14:22:14,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-23 14:22:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions.
[2023-11-23 14:22:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2023-11-23 14:22:14,138 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:22:14,138 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1]
[2023-11-23 14:22:14,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2023-11-23 14:22:14,343 WARN L477 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
[2023-11-23 14:22:14,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:22:14,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:22:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -416047817, now seen corresponding path program 3 times
[2023-11-23 14:22:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:22:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416796658]
[2023-11-23 14:22:14,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-23 14:22:14,345 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
[2023-11-23 14:22:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:22:14,346 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)
[2023-11-23 14:22:14,348 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
[2023-11-23 14:22:15,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2023-11-23 14:22:15,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-23 14:22:15,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-11-23 14:22:15,072 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:22:20,024 WARN L876 $PredicateComparison]: unable to prove that (and (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2023-11-23 14:22:33,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (and (not (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| |v_ULTIMATE.start_main_~main__x~0#1_16|)) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_16| .cse0)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2023-11-23 14:22:35,798 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (and (not (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| |v_ULTIMATE.start_main_~main__x~0#1_16|)) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_16| .cse0)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 14:23:01,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_16| .cse2))) (and (fp.eq .cse0 .cse1) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_16|))))) (= |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))) (and (= |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_16| .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse2) .cse3) (not (fp.eq .cse3 .cse1)) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_16|)))))))) is different from false
[2023-11-23 14:23:18,478 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_16| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_16|)))))) is different from false
[2023-11-23 14:23:20,529 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_16| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_16| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_16|)))))) is different from true
[2023-11-23 14:23:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 11 not checked.
[2023-11-23 14:23:20,529 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-23 14:23:34,740 WARN L876 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true
Killed by 15