./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.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 c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:36:26,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:36:26,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 23:36:26,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:36:26,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:36:26,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:36:26,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:36:26,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:36:26,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:36:26,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:36:26,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:36:26,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:36:26,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:36:26,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:36:26,227 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:36:26,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:36:26,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:36:26,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:36:26,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 23:36:26,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:36:26,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:36:26,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:36:26,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:36:26,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:36:26,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:36:26,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:36:26,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:36:26,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:36:26,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:36:26,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:36:26,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:36:26,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:36:26,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:36:26,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:36:26,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:36:26,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:36:26,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 23:36:26,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 23:36:26,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:36:26,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:36:26,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:36:26,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:36:26,235 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-21 23:36:26,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:36:26,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:36:26,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:36:26,461 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:36:26,461 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:36:26,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-21 23:36:27,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:36:27,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:36:27,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-21 23:36:27,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4cc8027/ed51df82cccb41199e813372de1b04d2/FLAG01b086461 [2024-11-21 23:36:28,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4cc8027/ed51df82cccb41199e813372de1b04d2 [2024-11-21 23:36:28,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:36:28,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:36:28,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:36:28,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:36:28,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:36:28,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b611233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28, skipping insertion in model container [2024-11-21 23:36:28,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:36:28,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-21 23:36:28,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:36:28,512 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:36:28,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-21 23:36:28,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:36:28,546 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:36:28,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28 WrapperNode [2024-11-21 23:36:28,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:36:28,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:36:28,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:36:28,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:36:28,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,607 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-21 23:36:28,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:36:28,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:36:28,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:36:28,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:36:28,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,649 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-21 23:36:28,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:36:28,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:36:28,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:36:28,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:36:28,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (1/1) ... [2024-11-21 23:36:28,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:36:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:36:28,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 23:36:28,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 23:36:28,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-21 23:36:28,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-21 23:36:28,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-21 23:36:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-21 23:36:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-21 23:36:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:36:28,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:36:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 23:36:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 23:36:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-21 23:36:28,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:36:28,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:36:28,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:36:28,995 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-21 23:36:28,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:36:29,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:36:29,007 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-21 23:36:29,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:29 BoogieIcfgContainer [2024-11-21 23:36:29,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:36:29,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:36:29,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:36:29,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:36:29,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:36:28" (1/3) ... [2024-11-21 23:36:29,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6bea66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:36:29, skipping insertion in model container [2024-11-21 23:36:29,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:28" (2/3) ... [2024-11-21 23:36:29,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6bea66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:36:29, skipping insertion in model container [2024-11-21 23:36:29,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:29" (3/3) ... [2024-11-21 23:36:29,018 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-21 23:36:29,039 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:36:29,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:36:29,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:36:29,095 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c28671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:36:29,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:36:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 23:36:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:36:29,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-21 23:36:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592115467] [2024-11-21 23:36:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:36:29,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592115467] [2024-11-21 23:36:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592115467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:36:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38041035] [2024-11-21 23:36:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:36:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:36:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:36:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:36:29,273 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:29,286 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-21 23:36:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:36:29,287 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-21 23:36:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:29,292 INFO L225 Difference]: With dead ends: 55 [2024-11-21 23:36:29,292 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:36:29,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:36:29,298 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:29,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:36:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-21 23:36:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 23:36:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:36:29,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-21 23:36:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:29,331 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:36:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:36:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:36:29,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 23:36:29,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-21 23:36:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132425189] [2024-11-21 23:36:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:29,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:36:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132425189] [2024-11-21 23:36:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132425189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202277331] [2024-11-21 23:36:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:29,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:36:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,552 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:29,580 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-21 23:36:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-21 23:36:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:29,582 INFO L225 Difference]: With dead ends: 39 [2024-11-21 23:36:29,582 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:36:29,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,584 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:29,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:36:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-21 23:36:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 23:36:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:36:29,592 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-21 23:36:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:36:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:36:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:36:29,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 23:36:29,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-21 23:36:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740674755] [2024-11-21 23:36:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:36:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740674755] [2024-11-21 23:36:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740674755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660935881] [2024-11-21 23:36:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:29,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:36:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,672 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:29,702 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:36:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-21 23:36:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:29,703 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:36:29,703 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:36:29,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,704 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:29,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:36:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:36:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 23:36:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:36:29,712 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-21 23:36:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:36:29,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:36:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:36:29,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 23:36:29,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-21 23:36:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479807451] [2024-11-21 23:36:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:36:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479807451] [2024-11-21 23:36:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479807451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845693733] [2024-11-21 23:36:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:29,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:36:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,806 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:29,824 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:36:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-21 23:36:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:29,826 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:36:29,826 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:36:29,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,829 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:29,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:36:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:36:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 23:36:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:36:29,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-21 23:36:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:29,837 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:36:29,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:36:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:36:29,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 23:36:29,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-21 23:36:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740765814] [2024-11-21 23:36:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:36:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740765814] [2024-11-21 23:36:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740765814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150648628] [2024-11-21 23:36:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:29,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:36:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,909 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:29,932 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:36:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-21 23:36:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:29,932 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:36:29,932 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:36:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:29,933 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:29,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:36:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:36:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 23:36:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:36:29,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-21 23:36:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:29,942 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:36:29,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:36:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:36:29,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:29,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 23:36:29,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:29,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-21 23:36:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:36:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416621505] [2024-11-21 23:36:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:36:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:36:29,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:36:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:36:29,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 23:36:29,990 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:36:29,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:36:29,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 23:36:29,994 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-21 23:36:30,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:36:30,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:36:30 BoogieIcfgContainer [2024-11-21 23:36:30,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:36:30,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:36:30,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:36:30,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:36:30,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:29" (3/4) ... [2024-11-21 23:36:30,019 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 23:36:30,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:36:30,022 INFO L158 Benchmark]: Toolchain (without parser) took 1674.96ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 68.3MB in the end (delta: 54.5MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,023 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 82.5MB in the beginning and 82.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:36:30,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.15ms. Allocated memory is still 151.0MB. Free memory was 122.6MB in the beginning and 109.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.07ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 108.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:36:30,026 INFO L158 Benchmark]: Boogie Preprocessor took 53.21ms. Allocated memory is still 151.0MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,026 INFO L158 Benchmark]: RCFGBuilder took 346.36ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 91.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,026 INFO L158 Benchmark]: TraceAbstraction took 1006.52ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 69.4MB in the end (delta: 21.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,026 INFO L158 Benchmark]: Witness Printer took 5.66ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 68.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 23:36:30,027 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 117.4MB. Free memory was 82.5MB in the beginning and 82.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.15ms. Allocated memory is still 151.0MB. Free memory was 122.6MB in the beginning and 109.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.07ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 108.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.21ms. Allocated memory is still 151.0MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.36ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 91.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1006.52ms. Allocated memory is still 151.0MB. Free memory was 90.5MB in the beginning and 69.4MB in the end (delta: 21.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 5.66ms. Allocated memory is still 151.0MB. Free memory was 69.4MB in the beginning and 68.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: 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 80, overapproximation of someUnaryFLOAToperation at line 76. Possible FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L23] __uint32_t w; VAL [\old(x)=0, x=0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=4286578689, x=0] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=0, \result=0, x=0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0, y=4286578698] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\result=4286578698, x=0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=4286578698] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() VAL [res=4286578698] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 175 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-21 23:36:30,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.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 c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:36:32,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:36:32,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 23:36:32,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:36:32,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:36:32,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:36:32,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:36:32,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:36:32,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:36:32,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:36:32,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:36:32,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:36:32,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:36:32,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:36:32,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:36:32,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:36:32,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:36:32,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:36:32,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:36:32,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:36:32,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:36:32,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:36:32,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:36:32,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 23:36:32,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 23:36:32,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:36:32,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 23:36:32,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:36:32,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:36:32,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:36:32,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:36:32,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:36:32,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:36:32,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:36:32,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:36:32,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:36:32,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:36:32,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:36:32,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 23:36:32,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 23:36:32,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:36:32,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:36:32,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:36:32,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:36:32,155 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-21 23:36:32,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:36:32,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:36:32,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:36:32,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:36:32,467 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:36:32,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-21 23:36:34,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:36:34,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:36:34,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-21 23:36:34,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4bd5d0f/0e3bd7ec868c4b45afa6ab506064391b/FLAG8b9ab1377 [2024-11-21 23:36:34,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4bd5d0f/0e3bd7ec868c4b45afa6ab506064391b [2024-11-21 23:36:34,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:36:34,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:36:34,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:36:34,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:36:34,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:36:34,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cc3a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34, skipping insertion in model container [2024-11-21 23:36:34,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:36:34,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-21 23:36:34,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:36:34,462 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:36:34,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-21 23:36:34,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:36:34,505 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:36:34,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34 WrapperNode [2024-11-21 23:36:34,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:36:34,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:36:34,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:36:34,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:36:34,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,543 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-21 23:36:34,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:36:34,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:36:34,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:36:34,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:36:34,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,573 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-21 23:36:34,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:36:34,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:36:34,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:36:34,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:36:34,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (1/1) ... [2024-11-21 23:36:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:36:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:36:34,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 23:36:34,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 23:36:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:36:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 23:36:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-21 23:36:34,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-21 23:36:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:36:34,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:36:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-21 23:36:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-21 23:36:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-21 23:36:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:36:34,745 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:36:34,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:36:34,902 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-21 23:36:34,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:36:34,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:36:34,913 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-21 23:36:34,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:34 BoogieIcfgContainer [2024-11-21 23:36:34,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:36:34,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:36:34,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:36:34,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:36:34,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:36:34" (1/3) ... [2024-11-21 23:36:34,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db9dc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:36:34, skipping insertion in model container [2024-11-21 23:36:34,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:36:34" (2/3) ... [2024-11-21 23:36:34,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db9dc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:36:34, skipping insertion in model container [2024-11-21 23:36:34,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:34" (3/3) ... [2024-11-21 23:36:34,922 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-21 23:36:34,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:36:34,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:36:34,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:36:35,003 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@213c17d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:36:35,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:36:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 23:36:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-21 23:36:35,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:35,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:35,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-21 23:36:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381812347] [2024-11-21 23:36:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:35,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:35,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-21 23:36:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:35,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-21 23:36:35,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:35,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:35,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381812347] [2024-11-21 23:36:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381812347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:36:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852500623] [2024-11-21 23:36:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:35,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:36:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:36:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:36:35,172 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:35,192 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-21 23:36:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:36:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-21 23:36:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:35,203 INFO L225 Difference]: With dead ends: 51 [2024-11-21 23:36:35,203 INFO L226 Difference]: Without dead ends: 24 [2024-11-21 23:36:35,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:36:35,209 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:35,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-21 23:36:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-21 23:36:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 23:36:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-21 23:36:35,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-21 23:36:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:35,239 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-21 23:36:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-21 23:36:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:36:35,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:35,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:35,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-21 23:36:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:35,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:35,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-21 23:36:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554411334] [2024-11-21 23:36:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:35,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:35,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:35,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-21 23:36:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:35,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:36:35,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:35,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:35,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:35,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554411334] [2024-11-21 23:36:35,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554411334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:35,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:35,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:35,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541894740] [2024-11-21 23:36:35,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:35,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:35,576 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:35,600 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-21 23:36:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-21 23:36:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:35,602 INFO L225 Difference]: With dead ends: 36 [2024-11-21 23:36:35,603 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 23:36:35,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:35,604 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:35,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 23:36:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-21 23:36:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 23:36:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-21 23:36:35,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-21 23:36:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:35,618 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-21 23:36:35,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-21 23:36:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:36:35,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:35,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:35,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-21 23:36:35,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:35,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:35,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-21 23:36:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656862602] [2024-11-21 23:36:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:35,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:35,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:35,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:35,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-21 23:36:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:35,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-21 23:36:35,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 23:36:36,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:36,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656862602] [2024-11-21 23:36:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656862602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:36:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718649508] [2024-11-21 23:36:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:36,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:36:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:36:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:36:36,134 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:36,334 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-21 23:36:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:36:36,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-21 23:36:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:36,338 INFO L225 Difference]: With dead ends: 49 [2024-11-21 23:36:36,338 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:36:36,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-21 23:36:36,342 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:36,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:36:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:36:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-21 23:36:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 23:36:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-21 23:36:36,354 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-21 23:36:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-21 23:36:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:36:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-21 23:36:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 23:36:36,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:36,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:36,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-21 23:36:36,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:36,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:36,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:36,557 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-21 23:36:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:36,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390067425] [2024-11-21 23:36:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:36,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:36,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:36,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-21 23:36:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:36,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:36:36,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-21 23:36:36,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:36,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:36,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390067425] [2024-11-21 23:36:36,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390067425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:36,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:36:36,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21099672] [2024-11-21 23:36:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:36,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:36:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:36:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:36,625 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2024-11-21 23:36:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:36,638 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-21 23:36:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:36:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 22 [2024-11-21 23:36:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:36,639 INFO L225 Difference]: With dead ends: 36 [2024-11-21 23:36:36,639 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 23:36:36,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:36:36,640 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:36,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 23:36:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-21 23:36:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 23:36:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-21 23:36:36,644 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-21 23:36:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-21 23:36:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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) [2024-11-21 23:36:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-21 23:36:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 23:36:36,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:36,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:36,649 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 [2024-11-21 23:36:36,845 WARN L453 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 [2024-11-21 23:36:36,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:36,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-21 23:36:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255703712] [2024-11-21 23:36:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:36,849 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) [2024-11-21 23:36:36,850 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 [2024-11-21 23:36:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:36,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:36:36,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 23:36:36,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:36,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255703712] [2024-11-21 23:36:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255703712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 23:36:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261679416] [2024-11-21 23:36:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 23:36:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 23:36:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:36:36,932 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-21 23:36:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:36,961 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-21 23:36:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 23:36:36,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2024-11-21 23:36:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:36,963 INFO L225 Difference]: With dead ends: 32 [2024-11-21 23:36:36,963 INFO L226 Difference]: Without dead ends: 29 [2024-11-21 23:36:36,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:36:36,964 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:36,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:36:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-21 23:36:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-21 23:36:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 23:36:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-21 23:36:36,973 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-21 23:36:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:36,973 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-21 23:36:36,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-21 23:36:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-21 23:36:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 23:36:36,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:36,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:36,978 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 (6)] Ended with exit code 0 [2024-11-21 23:36:37,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:37,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:37,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-21 23:36:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:37,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818006279] [2024-11-21 23:36:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:37,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:37,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:37,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-21 23:36:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:36:37,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:36:37,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:36:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-21 23:36:37,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:36:37,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:36:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818006279] [2024-11-21 23:36:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818006279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:36:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:36:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:36:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962961147] [2024-11-21 23:36:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:36:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:36:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:36:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:36:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:36:37,331 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-11-21 23:36:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:36:37,474 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-21 23:36:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:36:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2024-11-21 23:36:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:36:37,475 INFO L225 Difference]: With dead ends: 38 [2024-11-21 23:36:37,475 INFO L226 Difference]: Without dead ends: 21 [2024-11-21 23:36:37,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-21 23:36:37,476 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 23:36:37,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:36:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-21 23:36:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-21 23:36:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-21 23:36:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-21 23:36:37,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-21 23:36:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:36:37,481 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-21 23:36:37,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-11-21 23:36:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-21 23:36:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-21 23:36:37,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:36:37,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:37,488 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 (7)] Ended with exit code 0 [2024-11-21 23:36:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:37,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:36:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:36:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-21 23:36:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:36:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726568884] [2024-11-21 23:36:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:36:37,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:37,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:36:37,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:36:37,691 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 (8)] Waiting until timeout for monitored process [2024-11-21 23:36:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:36:37,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:36:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:36:37,804 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-21 23:36:37,804 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:36:37,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:36:37,816 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 (8)] Ended with exit code 0 [2024-11-21 23:36:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:36:38,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:36:38,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:36:38,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:36:38 BoogieIcfgContainer [2024-11-21 23:36:38,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:36:38,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:36:38,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:36:38,046 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:36:38,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:36:34" (3/4) ... [2024-11-21 23:36:38,047 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 23:36:38,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 23:36:38,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:36:38,084 INFO L158 Benchmark]: Toolchain (without parser) took 3875.94ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 32.3MB in the beginning and 79.7MB in the end (delta: -47.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,085 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 71.3MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:36:38,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.05ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 40.3MB in the end (delta: -8.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.04ms. Allocated memory is still 71.3MB. Free memory was 40.3MB in the beginning and 38.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,085 INFO L158 Benchmark]: Boogie Preprocessor took 56.60ms. Allocated memory is still 71.3MB. Free memory was 38.7MB in the beginning and 36.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,085 INFO L158 Benchmark]: RCFGBuilder took 310.66ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 36.4MB in the beginning and 101.6MB in the end (delta: -65.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,086 INFO L158 Benchmark]: TraceAbstraction took 3126.08ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 81.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,086 INFO L158 Benchmark]: Witness Printer took 41.50ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:36:38,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 71.3MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.05ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 40.3MB in the end (delta: -8.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.04ms. Allocated memory is still 71.3MB. Free memory was 40.3MB in the beginning and 38.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.60ms. Allocated memory is still 71.3MB. Free memory was 38.7MB in the beginning and 36.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.66ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 36.4MB in the beginning and 101.6MB in the end (delta: -65.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3126.08ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 81.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 41.50ms. Allocated memory is still 130.0MB. Free memory was 81.8MB in the beginning and 79.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 81]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_float(x) == 0) [L50] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_float(y) == 0) [L53] return x > y ? x : y; VAL [\result=0.0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0.0] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] CALL, EXPR __signbit_float(res) [L57] __uint32_t w; VAL [x=0.0] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (w) = gf_u.word [L65] return (w & 0x80000000) != 0; VAL [\result=1, x=0.0] [L80] RET, EXPR __signbit_float(res) [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 29, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 283 SizeOfPredicates, 9 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2024-11-21 23:36:38,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE