./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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/loop-floats-scientific-comp/loop1-1.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 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:11:57,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:11:57,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:11:57,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:11:57,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:11:58,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:11:58,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:11:58,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:11:58,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:11:58,028 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:11:58,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:11:58,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:11:58,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:11:58,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:11:58,031 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:11:58,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:11:58,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:11:58,031 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:11:58,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:11:58,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:11:58,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:11:58,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:11:58,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:11:58,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:11:58,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:11:58,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:11:58,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:11:58,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:11:58,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:11:58,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:11:58,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:11:58,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:11:58,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:11:58,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:11:58,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:11:58,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:11:58,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:11:58,037 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:11:58,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:11:58,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:11:58,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:11:58,276 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:11:58,276 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:11:58,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c [2023-11-22 21:11:59,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:11:59,546 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:11:59,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c [2023-11-22 21:11:59,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb23a4ae/39cff7ed9b41458380b7a36dca6967e9/FLAGb6716980d [2023-11-22 21:11:59,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb23a4ae/39cff7ed9b41458380b7a36dca6967e9 [2023-11-22 21:11:59,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:11:59,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:11:59,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:11:59,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:11:59,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:11:59,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cfb756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59, skipping insertion in model container [2023-11-22 21:11:59,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:11:59,720 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c[497,510] [2023-11-22 21:11:59,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:11:59,745 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:11:59,758 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c[497,510] [2023-11-22 21:11:59,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:11:59,775 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:11:59,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59 WrapperNode [2023-11-22 21:11:59,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:11:59,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:11:59,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:11:59,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:11:59,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,803 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-11-22 21:11:59,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:11:59,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:11:59,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:11:59,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:11:59,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:11:59,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:11:59,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:11:59,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:11:59,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (1/1) ... [2023-11-22 21:11:59,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:11:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:11:59,851 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-22 21:11:59,858 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-22 21:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 21:11:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 21:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:11:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:11:59,941 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:11:59,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:00,103 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:00,120 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:00,120 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:12:00,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:00 BoogieIcfgContainer [2023-11-22 21:12:00,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:00,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:00,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:00,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:00,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:11:59" (1/3) ... [2023-11-22 21:12:00,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256842cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:00, skipping insertion in model container [2023-11-22 21:12:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:11:59" (2/3) ... [2023-11-22 21:12:00,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256842cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:00, skipping insertion in model container [2023-11-22 21:12:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:00" (3/3) ... [2023-11-22 21:12:00,129 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2023-11-22 21:12:00,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:00,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:00,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:00,192 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;@6aa092e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:00,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 21:12:00,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:00,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:00,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:00,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 339381940, now seen corresponding path program 1 times [2023-11-22 21:12:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619790642] [2023-11-22 21:12:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:12:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:12:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:12:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:12:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619790642] [2023-11-22 21:12:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619790642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:12:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753310997] [2023-11-22 21:12:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:00,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:12:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:12:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:12:00,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:00,442 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:00,466 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2023-11-22 21:12:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:12:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-11-22 21:12:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:00,475 INFO L225 Difference]: With dead ends: 30 [2023-11-22 21:12:00,475 INFO L226 Difference]: Without dead ends: 14 [2023-11-22 21:12:00,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:00,480 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:00,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-22 21:12:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-22 21:12:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-22 21:12:00,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 16 [2023-11-22 21:12:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:00,507 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-22 21:12:00,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-22 21:12:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 21:12:00,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:00,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:00,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:12:00,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:00,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1593200358, now seen corresponding path program 1 times [2023-11-22 21:12:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:12:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95562860] [2023-11-22 21:12:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:12:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:12:00,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:12:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:12:00,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:12:00,575 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:12:00,576 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:12:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:12:00,580 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-22 21:12:00,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:12:00,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:12:00 BoogieIcfgContainer [2023-11-22 21:12:00,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:12:00,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:12:00,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:12:00,597 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:12:00,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:00" (3/4) ... [2023-11-22 21:12:00,598 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 21:12:00,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:12:00,600 INFO L158 Benchmark]: Toolchain (without parser) took 1025.01ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 80.6MB in the end (delta: 50.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-22 21:12:00,600 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:00,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.31ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 119.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 21:12:00,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.53ms. Allocated memory is still 161.5MB. Free memory was 119.7MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:12:00,601 INFO L158 Benchmark]: Boogie Preprocessor took 15.97ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 117.7MB in the end (delta: 695.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:00,601 INFO L158 Benchmark]: RCFGBuilder took 300.53ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 107.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 21:12:00,602 INFO L158 Benchmark]: TraceAbstraction took 473.16ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 80.6MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-22 21:12:00,602 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 161.5MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:12:00,604 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.16ms. Allocated memory is still 125.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.31ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 119.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.53ms. Allocated memory is still 161.5MB. Free memory was 119.7MB in the beginning and 118.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.97ms. Allocated memory is still 161.5MB. Free memory was 118.3MB in the beginning and 117.7MB in the end (delta: 695.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.53ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 107.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 473.16ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 80.6MB in the end (delta: 25.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 161.5MB. Free memory is still 80.6MB. 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: 13]: 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 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L21] CALL assume_abort_if_not(x > -1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L21] RET assume_abort_if_not(x > -1.0) [L22] CALL assume_abort_if_not(x < 1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L22] RET assume_abort_if_not(x < 1.0) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; VAL [count=1, exp=1, term=1] [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 VAL [count=2, temp=0] [L39] CALL __VERIFIER_assert( result >= exp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 15 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4/4 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-22 21:12:00,641 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/loop-floats-scientific-comp/loop1-1.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 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:12:02,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:12:02,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 21:12:02,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:12:02,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:12:02,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:12:02,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:12:02,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:12:02,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:12:02,874 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:12:02,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:12:02,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:12:02,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:12:02,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:12:02,876 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:12:02,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:12:02,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:12:02,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:12:02,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:12:02,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:12:02,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:12:02,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:12:02,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:12:02,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 21:12:02,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 21:12:02,879 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 21:12:02,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:12:02,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:12:02,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:12:02,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:12:02,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:12:02,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:12:02,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:12:02,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:02,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:12:02,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:12:02,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:12:02,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 21:12:02,882 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 21:12:02,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:12:02,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:12:02,883 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:12:02,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:12:02,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:12:02,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 21:12:02,884 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 -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:12:03,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:12:03,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:12:03,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:12:03,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:12:03,180 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:12:03,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c [2023-11-22 21:12:04,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:12:04,498 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:12:04,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c [2023-11-22 21:12:04,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008a40d61/7c34df32b7254bf7b9d64640b9028692/FLAG195b8a03c [2023-11-22 21:12:04,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008a40d61/7c34df32b7254bf7b9d64640b9028692 [2023-11-22 21:12:04,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:12:04,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:12:04,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:04,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:12:04,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:12:04,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78dcdd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04, skipping insertion in model container [2023-11-22 21:12:04,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,537 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:12:04,635 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c[497,510] [2023-11-22 21:12:04,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:04,664 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:12:04,674 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop1-1.c[497,510] [2023-11-22 21:12:04,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:12:04,690 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:12:04,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04 WrapperNode [2023-11-22 21:12:04,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:12:04,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:04,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:12:04,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:12:04,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,725 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-11-22 21:12:04,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:12:04,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:12:04,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:12:04,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:12:04,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:12:04,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:12:04,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:12:04,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:12:04,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (1/1) ... [2023-11-22 21:12:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:12:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:12:04,774 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-22 21:12:04,776 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-22 21:12:04,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:12:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-22 21:12:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 21:12:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 21:12:04,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:12:04,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:12:04,876 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:12:04,878 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:12:07,965 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:12:07,981 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:12:07,984 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:12:07,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:07 BoogieIcfgContainer [2023-11-22 21:12:07,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:12:07,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:12:07,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:12:07,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:12:07,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:12:04" (1/3) ... [2023-11-22 21:12:07,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278823cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:07, skipping insertion in model container [2023-11-22 21:12:07,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:12:04" (2/3) ... [2023-11-22 21:12:07,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278823cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:12:07, skipping insertion in model container [2023-11-22 21:12:07,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:12:07" (3/3) ... [2023-11-22 21:12:07,994 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2023-11-22 21:12:08,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:12:08,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:12:08,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:12:08,054 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;@3bcdec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:12:08,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:12:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 21:12:08,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:08,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:08,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:08,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 339381940, now seen corresponding path program 1 times [2023-11-22 21:12:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685057806] [2023-11-22 21:12:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:08,079 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-22 21:12:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:08,081 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-22 21:12:08,081 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-22 21:12:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:08,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 21:12:08,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:12:08,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:12:08,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:12:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685057806] [2023-11-22 21:12:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685057806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:12:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:12:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:12:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431564435] [2023-11-22 21:12:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:12:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:12:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:12:08,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:12:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:08,424 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 21:12:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:12:08,449 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2023-11-22 21:12:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:12:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2023-11-22 21:12:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:12:08,456 INFO L225 Difference]: With dead ends: 30 [2023-11-22 21:12:08,456 INFO L226 Difference]: Without dead ends: 14 [2023-11-22 21:12:08,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:12:08,463 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:12:08,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:12:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-22 21:12:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-22 21:12:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:12:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-22 21:12:08,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 16 [2023-11-22 21:12:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:12:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-22 21:12:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 21:12:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-22 21:12:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 21:12:08,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:12:08,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:12:08,496 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-22 21:12:08,697 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-22 21:12:08,698 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:12:08,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:12:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1593200358, now seen corresponding path program 1 times [2023-11-22 21:12:08,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:12:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342114179] [2023-11-22 21:12:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:12:08,699 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-22 21:12:08,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:12:08,701 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-22 21:12:08,702 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-22 21:12:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:12:09,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 21:12:09,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:12:31,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-22 21:12:48,497 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from false [2023-11-22 21:12:50,529 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from true [2023-11-22 21:13:34,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven .cse2)) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse0 .cse1) (fp.lt .cse0 .cse2) (not (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse7 .cse1) (fp.lt .cse7 .cse2) (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))))) is different from false [2023-11-22 21:13:51,178 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from false [2023-11-22 21:13:53,212 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from true [2023-11-22 21:13:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:13:53,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:13:53,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 21:13:53,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342114179] [2023-11-22 21:13:53,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342114179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:13:53,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:13:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 21:13:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162521497] [2023-11-22 21:13:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:13:53,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 21:13:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 21:13:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 21:13:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=28, Unknown=6, NotChecked=52, Total=110 [2023-11-22 21:13:53,216 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:13:56,863 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-22 21:13:58,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 21:14:00,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 21:14:02,399 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-22 21:14:04,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 21:14:06,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 21:14:08,414 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-22 21:14:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:14:08,417 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-11-22 21:14:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 21:14:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-22 21:14:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:14:08,466 INFO L225 Difference]: With dead ends: 20 [2023-11-22 21:14:08,466 INFO L226 Difference]: Without dead ends: 16 [2023-11-22 21:14:08,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=29, Invalid=37, Unknown=6, NotChecked=60, Total=132 [2023-11-22 21:14:08,467 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:14:08,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 97 Unchecked, 15.1s Time] [2023-11-22 21:14:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-22 21:14:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-22 21:14:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:14:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-22 21:14:08,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 17 [2023-11-22 21:14:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:14:08,471 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-22 21:14:08,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:14:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-11-22 21:14:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 21:14:08,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:14:08,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:14:08,499 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-22 21:14:08,681 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-22 21:14:08,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:14:08,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:14:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2105861185, now seen corresponding path program 1 times [2023-11-22 21:14:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 21:14:08,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017937986] [2023-11-22 21:14:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:14:08,683 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-22 21:14:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 21:14:08,684 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-22 21:14:08,685 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-22 21:14:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:14:16,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 21:14:16,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:15:15,086 WARN L293 SmtUtils]: Spent 24.38s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-22 21:16:20,876 WARN L293 SmtUtils]: Spent 26.89s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15