./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/bary_diverge.c --full-output --preprocessor.use.memory.slicer true --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/float-benchs/bary_diverge.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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:14:05,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:14:05,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 22:14:05,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:14:05,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:14:05,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:14:05,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:14:05,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:14:05,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:14:05,417 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:14:05,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:14:05,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:14:05,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:14:05,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:14:05,420 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:14:05,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:14:05,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:14:05,421 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:14:05,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:14:05,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:14:05,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:14:05,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:14:05,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:14:05,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:14:05,423 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:14:05,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:14:05,423 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:14:05,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:14:05,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:14:05,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:14:05,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:14:05,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:05,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:14:05,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:14:05,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:14:05,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:14:05,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:14:05,427 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:14:05,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:14:05,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:14:05,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:14:05,662 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:14:05,662 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:14:05,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/bary_diverge.c [2023-11-22 22:14:06,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:14:06,762 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:14:06,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c [2023-11-22 22:14:06,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3c713f4/41ba435e8c334ccb83954652a9b35fe1/FLAG7f1c65f6a [2023-11-22 22:14:06,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3c713f4/41ba435e8c334ccb83954652a9b35fe1 [2023-11-22 22:14:06,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:14:06,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:14:06,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:06,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:14:06,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:14:06,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:06,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c40b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06, skipping insertion in model container [2023-11-22 22:14:06,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:06,827 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:14:06,927 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c[632,645] [2023-11-22 22:14:06,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:06,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:14:06,970 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c[632,645] [2023-11-22 22:14:06,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:06,992 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:14:06,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06 WrapperNode [2023-11-22 22:14:06,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:06,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:06,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:14:06,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:14:07,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,032 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2023-11-22 22:14:07,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:07,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:14:07,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:14:07,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:14:07,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,049 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,059 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 22:14:07,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:14:07,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:14:07,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:14:07,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:14:07,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (1/1) ... [2023-11-22 22:14:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:07,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:14:07,100 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 22:14:07,104 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 22:14:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:14:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2023-11-22 22:14:07,138 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2023-11-22 22:14:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 22:14:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:14:07,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:14:07,208 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:14:07,212 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:14:07,347 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:14:07,369 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:14:07,369 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 22:14:07,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:07 BoogieIcfgContainer [2023-11-22 22:14:07,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:14:07,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:14:07,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:14:07,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:14:07,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:14:06" (1/3) ... [2023-11-22 22:14:07,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efc0ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:07, skipping insertion in model container [2023-11-22 22:14:07,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:06" (2/3) ... [2023-11-22 22:14:07,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efc0ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:07, skipping insertion in model container [2023-11-22 22:14:07,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:07" (3/3) ... [2023-11-22 22:14:07,378 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2023-11-22 22:14:07,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:14:07,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:14:07,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:14:07,432 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;@71d11878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:14:07,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:14:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 22:14:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:14:07,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:07,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:07,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:07,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1737229546, now seen corresponding path program 1 times [2023-11-22 22:14:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:14:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234333055] [2023-11-22 22:14:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:14:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 22:14:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 22:14:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:07,602 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 22:14:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:14:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234333055] [2023-11-22 22:14:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234333055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:14:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740141221] [2023-11-22 22:14:07,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:14:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:14:07,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:14:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:14:07,631 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 22:14:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:07,669 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2023-11-22 22:14:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:14:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 19 [2023-11-22 22:14:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:07,676 INFO L225 Difference]: With dead ends: 48 [2023-11-22 22:14:07,676 INFO L226 Difference]: Without dead ends: 23 [2023-11-22 22:14:07,679 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 22:14:07,684 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:07,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:14:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-22 22:14:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-22 22:14:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 22:14:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-22 22:14:07,714 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2023-11-22 22:14:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:07,715 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-22 22:14:07,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 22:14:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-22 22:14:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:14:07,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:07,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:07,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:14:07,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:07,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1143642386, now seen corresponding path program 1 times [2023-11-22 22:14:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:14:07,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836358315] [2023-11-22 22:14:07,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:14:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 22:14:07,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 22:14:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 22:14:07,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 22:14:07,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 22:14:07,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 22:14:07,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:14:07,789 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-22 22:14:07,791 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 22:14:07,801 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 22:14:07,802 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-22 22:14:07,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:14:07 BoogieIcfgContainer [2023-11-22 22:14:07,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 22:14:07,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 22:14:07,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 22:14:07,813 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 22:14:07,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:07" (3/4) ... [2023-11-22 22:14:07,815 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 22:14:07,816 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 22:14:07,817 INFO L158 Benchmark]: Toolchain (without parser) took 1013.81ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 61.4MB in the beginning and 91.6MB in the end (delta: -30.2MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,817 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:14:07,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.37ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 61.2MB in the beginning and 133.5MB in the end (delta: -72.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.12ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 134.1MB in the end (delta: -667.8kB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,822 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 132.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,822 INFO L158 Benchmark]: RCFGBuilder took 297.45ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 120.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,823 INFO L158 Benchmark]: TraceAbstraction took 439.85ms. Allocated memory is still 163.6MB. Free memory was 119.5MB in the beginning and 91.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-22 22:14:07,823 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 163.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:14:07,829 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.13ms. Allocated memory is still 132.1MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.37ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 61.2MB in the beginning and 133.5MB in the end (delta: -72.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.12ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 134.1MB in the end (delta: -667.8kB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 132.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.45ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 120.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 439.85ms. Allocated memory is still 163.6MB. Free memory was 119.5MB in the beginning and 91.6MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 163.6MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 14]: 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 someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0, \old(cond)=1, cond=1] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0, \old(cond)=1, cond=1] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; [L59] RET, EXPR RANDOM_INPUT() VAL [C1=53, I=0, INIT=1, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=53, I=54, INIT=1, X=0, Y=0, Z=0, i=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND TRUE C1 > 0.f [L37] Z = Y [L38] Y = X VAL [C1=53, I=54, INIT=1, X=0, Y=0, Z=0] [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I VAL [C1=53, I=54, INIT=1, X=54, Y=54, Z=54] [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [C1=53, I=54, INIT=1, X=54, Y=54, Z=54, \old(cond)=0, cond=0] [L14] reach_error() VAL [C1=53, I=54, INIT=1, X=54, Y=54, Z=54, \old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 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, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 26 mSDtfsCounter, 5 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=25occurred 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, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 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 22:14:07,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/float-benchs/bary_diverge.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 b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:14:09,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:14:09,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 22:14:09,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:14:09,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:14:09,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:14:09,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:14:09,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:14:09,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:14:09,792 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:14:09,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:14:09,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:14:09,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:14:09,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:14:09,793 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:14:09,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:14:09,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:14:09,794 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:14:09,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:14:09,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:14:09,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:14:09,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:14:09,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:14:09,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 22:14:09,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 22:14:09,796 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 22:14:09,796 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:14:09,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:14:09,797 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:14:09,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:14:09,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:14:09,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:14:09,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:14:09,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:09,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:14:09,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:14:09,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:14:09,799 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 22:14:09,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 22:14:09,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:14:09,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:14:09,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:14:09,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:14:09,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:14:09,801 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 22:14:09,801 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 -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:14:10,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:14:10,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:14:10,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:14:10,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:14:10,085 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:14:10,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/bary_diverge.c [2023-11-22 22:14:11,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:14:11,320 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:14:11,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c [2023-11-22 22:14:11,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df04edcc/6b9a661fe70248fca3a294dd85d41534/FLAG8bc274a7c [2023-11-22 22:14:11,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df04edcc/6b9a661fe70248fca3a294dd85d41534 [2023-11-22 22:14:11,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:14:11,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:14:11,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:11,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:14:11,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:14:11,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d853e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11, skipping insertion in model container [2023-11-22 22:14:11,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,371 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:14:11,478 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c[632,645] [2023-11-22 22:14:11,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:11,511 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:14:11,522 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/bary_diverge.c[632,645] [2023-11-22 22:14:11,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:14:11,553 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:14:11,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11 WrapperNode [2023-11-22 22:14:11,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:14:11,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:11,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:14:11,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:14:11,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,594 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 70 [2023-11-22 22:14:11,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:14:11,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:14:11,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:14:11,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:14:11,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,609 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,625 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 22:14:11,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:14:11,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:14:11,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:14:11,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:14:11,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (1/1) ... [2023-11-22 22:14:11,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:14:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:14:11,676 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 22:14:11,688 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 22:14:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2023-11-22 22:14:11,721 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2023-11-22 22:14:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 22:14:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:14:11,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:14:11,805 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:14:11,807 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:14:14,004 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:14:14,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:14:14,028 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 22:14:14,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:14 BoogieIcfgContainer [2023-11-22 22:14:14,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:14:14,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:14:14,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:14:14,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:14:14,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:14:11" (1/3) ... [2023-11-22 22:14:14,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7615d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:14, skipping insertion in model container [2023-11-22 22:14:14,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:14:11" (2/3) ... [2023-11-22 22:14:14,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7615d295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:14:14, skipping insertion in model container [2023-11-22 22:14:14,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:14:14" (3/3) ... [2023-11-22 22:14:14,034 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2023-11-22 22:14:14,046 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:14:14,047 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:14:14,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:14:14,080 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;@2314b8cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:14:14,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:14:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 22:14:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:14:14,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:14,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:14,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:14,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1737229546, now seen corresponding path program 1 times [2023-11-22 22:14:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961883060] [2023-11-22 22:14:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:14,102 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 22:14:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:14,104 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 22:14:14,109 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 22:14:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:14,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 22:14:14,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:14:14,187 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 22:14:14,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:14:14,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:14:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961883060] [2023-11-22 22:14:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961883060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:14:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899745980] [2023-11-22 22:14:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:14,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 22:14:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:14:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 22:14:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 22:14:14,225 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 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 22:14:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:14,259 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2023-11-22 22:14:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 22:14:14,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 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 19 [2023-11-22 22:14:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:14,265 INFO L225 Difference]: With dead ends: 48 [2023-11-22 22:14:14,265 INFO L226 Difference]: Without dead ends: 23 [2023-11-22 22:14:14,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 22:14:14,269 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:14,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:14:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-22 22:14:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-22 22:14:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 22:14:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-22 22:14:14,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2023-11-22 22:14:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:14,293 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-22 22:14:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 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 22:14:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-22 22:14:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:14:14,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:14,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 22:14:14,500 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 22:14:14,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:14,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1143642386, now seen corresponding path program 1 times [2023-11-22 22:14:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827777900] [2023-11-22 22:14:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:14,502 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 22:14:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:14,503 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 22:14:14,510 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 22:14:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:14,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 22:14:14,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:14:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 22:14:14,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:14:14,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:14:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827777900] [2023-11-22 22:14:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827777900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 22:14:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349011102] [2023-11-22 22:14:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 22:14:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:14:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 22:14:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:14:14,935 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 22:14:17,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:19,390 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 22:14:20,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:24,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:26,256 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 22:14:28,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:30,461 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 22:14:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:30,493 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-11-22 22:14:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 22:14:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2023-11-22 22:14:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:30,496 INFO L225 Difference]: With dead ends: 59 [2023-11-22 22:14:30,496 INFO L226 Difference]: Without dead ends: 57 [2023-11-22 22:14:30,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-11-22 22:14:30,497 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:30,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 103 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 15.0s Time] [2023-11-22 22:14:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-22 22:14:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2023-11-22 22:14:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 22:14:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2023-11-22 22:14:30,505 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 19 [2023-11-22 22:14:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:30,505 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2023-11-22 22:14:30,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 22:14:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2023-11-22 22:14:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 22:14:30,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:30,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:30,515 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 22:14:30,706 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 22:14:30,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:30,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1143701968, now seen corresponding path program 1 times [2023-11-22 22:14:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:30,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207931208] [2023-11-22 22:14:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:30,708 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 22:14:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:30,709 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 22:14:30,762 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 22:14:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:30,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 22:14:30,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:14:30,997 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 22:14:30,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:14:30,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:14:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207931208] [2023-11-22 22:14:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207931208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 22:14:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488149935] [2023-11-22 22:14:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:30,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 22:14:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:14:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 22:14:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 22:14:30,999 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 22:14:33,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:33,136 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2023-11-22 22:14:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 22:14:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-22 22:14:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:33,138 INFO L225 Difference]: With dead ends: 71 [2023-11-22 22:14:33,138 INFO L226 Difference]: Without dead ends: 53 [2023-11-22 22:14:33,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 22:14:33,139 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:33,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-11-22 22:14:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-22 22:14:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2023-11-22 22:14:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 22:14:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-11-22 22:14:33,148 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 19 [2023-11-22 22:14:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:33,148 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-11-22 22:14:33,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 22:14:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-11-22 22:14:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-22 22:14:33,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:33,150 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:33,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-22 22:14:33,356 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-22 22:14:33,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:33,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash 310107510, now seen corresponding path program 1 times [2023-11-22 22:14:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158290485] [2023-11-22 22:14:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:33,358 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 22:14:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:33,359 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-22 22:14:33,365 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-22 22:14:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:33,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 22:14:33,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:14:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 22:14:33,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 22:14:33,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 22:14:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158290485] [2023-11-22 22:14:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158290485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:14:33,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:14:33,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 22:14:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322802602] [2023-11-22 22:14:33,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:14:33,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 22:14:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 22:14:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 22:14:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 22:14:33,752 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-22 22:14:36,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:38,500 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 22:14:40,503 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 22:14:43,297 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 22:14:45,312 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-22 22:14:46,452 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-22 22:14:49,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:51,035 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 22:14:53,039 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 22:14:55,041 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 22:14:56,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-22 22:14:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:14:56,949 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-11-22 22:14:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 22:14:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2023-11-22 22:14:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:14:56,952 INFO L225 Difference]: With dead ends: 69 [2023-11-22 22:14:56,952 INFO L226 Difference]: Without dead ends: 67 [2023-11-22 22:14:56,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-22 22:14:56,953 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 22 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2023-11-22 22:14:56,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 175 Invalid, 9 Unknown, 0 Unchecked, 22.6s Time] [2023-11-22 22:14:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-22 22:14:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2023-11-22 22:14:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 22:14:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-11-22 22:14:56,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2023-11-22 22:14:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:14:56,960 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-22 22:14:56,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-22 22:14:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-11-22 22:14:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-22 22:14:56,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:14:56,961 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:14:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 22:14:57,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 22:14:57,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:14:57,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:14:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash 310167092, now seen corresponding path program 1 times [2023-11-22 22:14:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 22:14:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987528697] [2023-11-22 22:14:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:14:57,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 22:14:57,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 22:14:57,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 22:14:57,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 22:14:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:14:57,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 22:14:57,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 22:15:57,321 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) is different from false [2023-11-22 22:16:16,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from false [2023-11-22 22:16:18,451 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from true [2023-11-22 22:16:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 1 not checked. [2023-11-22 22:16:18,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 22:16:31,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2023-11-22 22:16:33,561 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2023-11-22 22:16:43,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2023-11-22 22:16:45,829 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2023-11-22 22:18:16,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2023-11-22 22:18:18,828 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2023-11-22 22:18:45,650 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true Killed by 15