./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_1232b.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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:22:07,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:22:07,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 18:22:07,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:22:07,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:22:07,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:22:07,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:22:07,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:22:07,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:22:07,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:22:07,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:22:07,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:22:07,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:22:07,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:22:07,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:22:07,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:22:07,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:22:07,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:22:07,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 18:22:07,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:22:07,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:22:07,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:22:07,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:22:07,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:22:07,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:22:07,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:22:07,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:22:07,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:22:07,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:22:07,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:22:07,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:22:07,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:22:07,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:07,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:22:07,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:22:07,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:22:07,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 18:22:07,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 18:22:07,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:22:07,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:22:07,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:22:07,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:22:07,403 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 -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-11 18:22:07,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:22:07,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:22:07,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:22:07,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:22:07,726 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:22:07,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-11 18:22:09,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:22:09,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:22:09,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-11 18:22:09,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dac8c0d1/b0d5c350b3674d96b349efb505c54ff0/FLAG78708b838 [2024-11-11 18:22:09,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dac8c0d1/b0d5c350b3674d96b349efb505c54ff0 [2024-11-11 18:22:09,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:22:09,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:22:09,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:09,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:22:09,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:22:09,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754cb457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09, skipping insertion in model container [2024-11-11 18:22:09,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:22:09,725 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_1232b.c[1657,1670] [2024-11-11 18:22:09,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:09,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:22:09,772 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_1232b.c[1657,1670] [2024-11-11 18:22:09,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:09,796 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:22:09,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09 WrapperNode [2024-11-11 18:22:09,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:09,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:09,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:22:09,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:22:09,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,834 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-11 18:22:09,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:09,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:22:09,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:22:09,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:22:09,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,876 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-11 18:22:09,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:22:09,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:22:09,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:22:09,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:22:09,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (1/1) ... [2024-11-11 18:22:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:22:09,957 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-11 18:22:09,961 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-11 18:22:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:22:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 18:22:10,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 18:22:10,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 18:22:10,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:22:10,002 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:22:10,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:22:10,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-11 18:22:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-11 18:22:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-11 18:22:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:22:10,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:22:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 18:22:10,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 18:22:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 18:22:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:22:10,081 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:22:10,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:22:10,256 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-11 18:22:10,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:22:10,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:22:10,268 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 18:22:10,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:10 BoogieIcfgContainer [2024-11-11 18:22:10,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:22:10,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:22:10,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:22:10,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:22:10,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:22:09" (1/3) ... [2024-11-11 18:22:10,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4abaa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:10, skipping insertion in model container [2024-11-11 18:22:10,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:09" (2/3) ... [2024-11-11 18:22:10,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4abaa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:10, skipping insertion in model container [2024-11-11 18:22:10,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:10" (3/3) ... [2024-11-11 18:22:10,276 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-11 18:22:10,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:22:10,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:22:10,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:22:10,364 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;@515f5278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:22:10,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:22:10,369 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-11 18:22:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 18:22:10,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-11 18:22:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126658661] [2024-11-11 18:22:10,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:10,681 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-11 18:22:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126658661] [2024-11-11 18:22:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126658661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:10,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 18:22:10,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835650400] [2024-11-11 18:22:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 18:22:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 18:22:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 18:22:10,750 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 3 states, 3 states have (on average 4.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-11 18:22:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:10,802 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-11 18:22:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 18:22:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (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-11 18:22:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:10,811 INFO L225 Difference]: With dead ends: 55 [2024-11-11 18:22:10,812 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 18:22:10,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 18:22:10,819 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:10,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 18:22:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 18:22:10,858 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-11 18:22:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-11 18:22:10,861 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-11 18:22:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-11 18:22:10,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (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-11 18:22:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-11 18:22:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:22:10,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:10,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 18:22:10,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-11 18:22:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307953644] [2024-11-11 18:22:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,149 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-11 18:22:11,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307953644] [2024-11-11 18:22:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307953644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38613128] [2024-11-11 18:22:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:11,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:11,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:11,157 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-11 18:22:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:11,209 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-11 18:22:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-11 18:22:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:11,214 INFO L225 Difference]: With dead ends: 39 [2024-11-11 18:22:11,214 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 18:22:11,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 18:22:11,217 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:11,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 18:22:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 18:22:11,236 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-11 18:22:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:11,238 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-11 18:22:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:11,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-11 18:22:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 18:22:11,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:11,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 18:22:11,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-11 18:22:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838667421] [2024-11-11 18:22:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,406 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-11 18:22:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838667421] [2024-11-11 18:22:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838667421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:11,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206411724] [2024-11-11 18:22:11,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:11,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:11,414 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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-11 18:22:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:11,468 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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-11 18:22:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:11,470 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:11,470 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:11,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 18:22:11,472 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:11,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:11,478 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-11 18:22:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:11,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-11 18:22:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:11,480 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:11,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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-11 18:22:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 18:22:11,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:11,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:11,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 18:22:11,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:11,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-11 18:22:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338891778] [2024-11-11 18:22:11,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,642 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-11 18:22:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338891778] [2024-11-11 18:22:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338891778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715028812] [2024-11-11 18:22:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:11,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:11,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:11,646 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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-11 18:22:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:11,701 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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-11 18:22:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:11,703 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:11,703 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:11,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 18:22:11,705 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:11,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:11,717 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-11 18:22:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:11,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-11 18:22:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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-11 18:22:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 18:22:11,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:11,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:11,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 18:22:11,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:11,725 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-11 18:22:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723193985] [2024-11-11 18:22:11,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 18:22:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:11,827 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-11 18:22:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:22:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723193985] [2024-11-11 18:22:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723193985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:11,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124165469] [2024-11-11 18:22:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:22:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:11,832 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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-11 18:22:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:11,866 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-11 18:22:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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-11 18:22:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:11,867 INFO L225 Difference]: With dead ends: 43 [2024-11-11 18:22:11,867 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:22:11,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 18:22:11,869 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:22:11,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:22:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:22:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-11 18:22:11,879 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-11 18:22:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-11 18:22:11,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-11 18:22:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:11,881 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-11 18:22:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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-11 18:22:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-11 18:22:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 18:22:11,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:11,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 18:22:11,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-11 18:22:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:22:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814690146] [2024-11-11 18:22:11,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:22:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:11,907 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 18:22:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:11,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 18:22:11,939 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 18:22:11,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:22:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 18:22:11,948 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-11 18:22:11,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:11,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:22:11 BoogieIcfgContainer [2024-11-11 18:22:11,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:22:11,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:22:11,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:22:11,982 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:22:11,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:10" (3/4) ... [2024-11-11 18:22:11,984 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 18:22:11,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:22:11,986 INFO L158 Benchmark]: Toolchain (without parser) took 2526.55ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 52.0MB in the end (delta: 61.0MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,986 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:11,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.18ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 98.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,987 INFO L158 Benchmark]: Boogie Preprocessor took 68.30ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,988 INFO L158 Benchmark]: RCFGBuilder took 363.86ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 81.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,988 INFO L158 Benchmark]: TraceAbstraction took 1709.83ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 52.2MB in the end (delta: 28.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-11 18:22:11,988 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 167.8MB. Free memory was 52.2MB in the beginning and 52.0MB in the end (delta: 195.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:11,990 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.23ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.18ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 98.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.30ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 96.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.86ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 81.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1709.83ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 52.2MB in the end (delta: 28.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 167.8MB. Free memory was 52.2MB in the beginning and 52.0MB in the end (delta: 195.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 72]: 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 71, overapproximation of someUnaryFLOAToperation at line 66. Possible FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578698] [L15] __uint32_t w; VAL [\old(x)=4286578698, x=4286578698] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=4286578698, \result=0, x=4286578698] [L38] RET, EXPR __fpclassify_float(x) VAL [x=4286578698, y=0] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=0, x=4286578698] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 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-11 18:22:12,026 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/11.0.12-open/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_1232b.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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:22:14,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:22:14,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 18:22:14,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:22:14,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:22:14,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:22:14,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:22:14,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:22:14,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:22:14,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:22:14,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:22:14,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:22:14,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:22:14,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:22:14,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:22:14,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:22:14,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:22:14,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:22:14,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:22:14,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:22:14,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:22:14,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:22:14,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:22:14,602 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 18:22:14,602 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 18:22:14,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:22:14,604 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 18:22:14,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:22:14,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:22:14,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:22:14,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:22:14,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:22:14,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:22:14,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:22:14,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:14,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:22:14,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:22:14,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:22:14,614 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 18:22:14,614 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 18:22:14,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:22:14,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:22:14,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:22:14,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:22:14,617 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 -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-11 18:22:14,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:22:15,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:22:15,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:22:15,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:22:15,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:22:15,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-11 18:22:16,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:22:16,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:22:16,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-11 18:22:16,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfe64ba8/b6efa09c6a234be98a15dcf39da4b408/FLAG9ccf47a3e [2024-11-11 18:22:16,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfe64ba8/b6efa09c6a234be98a15dcf39da4b408 [2024-11-11 18:22:16,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:22:16,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:22:16,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:16,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:22:16,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:22:16,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:16" (1/1) ... [2024-11-11 18:22:16,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34feb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:16, skipping insertion in model container [2024-11-11 18:22:16,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:22:16" (1/1) ... [2024-11-11 18:22:17,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:22:17,230 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_1232b.c[1657,1670] [2024-11-11 18:22:17,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:17,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:22:17,282 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_1232b.c[1657,1670] [2024-11-11 18:22:17,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:22:17,307 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:22:17,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17 WrapperNode [2024-11-11 18:22:17,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:22:17,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:17,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:22:17,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:22:17,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,354 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-11 18:22:17,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:22:17,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:22:17,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:22:17,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:22:17,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,402 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-11 18:22:17,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:22:17,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:22:17,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:22:17,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:22:17,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (1/1) ... [2024-11-11 18:22:17,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:22:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:22:17,478 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-11 18:22:17,486 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-11 18:22:17,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:22:17,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 18:22:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 18:22:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 18:22:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:22:17,540 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-11 18:22:17,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-11 18:22:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 18:22:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 18:22:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 18:22:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:22:17,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:22:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-11 18:22:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-11 18:22:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-11 18:22:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:22:17,636 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:22:17,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:22:17,899 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-11 18:22:17,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:22:17,916 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:22:17,917 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 18:22:17,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:17 BoogieIcfgContainer [2024-11-11 18:22:17,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:22:17,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:22:17,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:22:17,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:22:17,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:22:16" (1/3) ... [2024-11-11 18:22:17,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4760c8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:17, skipping insertion in model container [2024-11-11 18:22:17,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:22:17" (2/3) ... [2024-11-11 18:22:17,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4760c8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:22:17, skipping insertion in model container [2024-11-11 18:22:17,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:17" (3/3) ... [2024-11-11 18:22:17,929 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-11 18:22:17,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:22:17,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:22:18,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:22:18,034 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;@7ddfc1cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:22:18,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:22:18,040 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-11 18:22:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 18:22:18,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-11 18:22:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324878702] [2024-11-11 18:22:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:18,070 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-11 18:22:18,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:18,074 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-11 18:22:18,076 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-11 18:22:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:18,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 18:22:18,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:18,192 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-11 18:22:18,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:18,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324878702] [2024-11-11 18:22:18,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324878702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:18,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:18,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 18:22:18,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955130131] [2024-11-11 18:22:18,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:18,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 18:22:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 18:22:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:22:18,231 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-11 18:22:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:18,256 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-11 18:22:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 18:22:18,258 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-11 18:22:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:18,268 INFO L225 Difference]: With dead ends: 51 [2024-11-11 18:22:18,268 INFO L226 Difference]: Without dead ends: 24 [2024-11-11 18:22:18,272 INFO L434 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-11 18:22:18,278 INFO L435 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-11 18:22:18,279 INFO L436 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-11 18:22:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-11 18:22:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-11 18:22:18,318 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-11 18:22:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-11 18:22:18,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-11 18:22:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:18,323 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-11 18:22:18,324 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-11 18:22:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-11 18:22:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 18:22:18,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 18:22:18,526 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-11 18:22:18,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-11 18:22:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74951619] [2024-11-11 18:22:18,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:18,529 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-11 18:22:18,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:18,533 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-11 18:22:18,535 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-11 18:22:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:18,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:18,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:18,910 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-11 18:22:18,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:18,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:18,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74951619] [2024-11-11 18:22:18,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74951619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:18,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:18,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747462714] [2024-11-11 18:22:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:18,920 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-11 18:22:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:18,945 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-11 18:22:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:18,946 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-11 18:22:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:18,949 INFO L225 Difference]: With dead ends: 36 [2024-11-11 18:22:18,949 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 18:22:18,950 INFO L434 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-11 18:22:18,952 INFO L435 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-11 18:22:18,952 INFO L436 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-11 18:22:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 18:22:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 18:22:18,964 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-11 18:22:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-11 18:22:18,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-11 18:22:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:18,967 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-11 18:22:18,967 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-11 18:22:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-11 18:22:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:22:18,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:18,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:18,973 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 (3)] Ended with exit code 0 [2024-11-11 18:22:19,169 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-11 18:22:19,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-11 18:22:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876057451] [2024-11-11 18:22:19,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:19,173 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-11 18:22:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:19,176 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-11 18:22:19,179 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-11 18:22:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 18:22:19,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:19,472 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-11 18:22:19,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:19,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876057451] [2024-11-11 18:22:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876057451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:19,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 18:22:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308581893] [2024-11-11 18:22:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:19,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 18:22:19,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 18:22:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 18:22:19,477 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-11 18:22:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:19,686 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-11 18:22:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 18:22:19,687 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-11 18:22:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:19,688 INFO L225 Difference]: With dead ends: 49 [2024-11-11 18:22:19,688 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 18:22:19,689 INFO L434 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-11 18:22:19,689 INFO L435 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-11 18:22:19,690 INFO L436 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-11 18:22:19,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 18:22:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 18:22:19,700 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-11 18:22:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-11 18:22:19,702 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-11 18:22:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:19,702 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-11 18:22:19,703 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-11 18:22:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-11 18:22:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 18:22:19,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:19,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:19,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:19,908 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-11 18:22:19,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-11 18:22:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675657935] [2024-11-11 18:22:19,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:19,911 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-11 18:22:19,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:19,915 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-11 18:22:19,916 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-11 18:22:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:19,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 18:22:19,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:20,016 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-11 18:22:20,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:20,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675657935] [2024-11-11 18:22:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675657935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:22:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036018968] [2024-11-11 18:22:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:22:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:22:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:22:20,020 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-11 18:22:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:20,046 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-11 18:22:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:22:20,047 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-11 18:22:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:20,048 INFO L225 Difference]: With dead ends: 36 [2024-11-11 18:22:20,048 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 18:22:20,048 INFO L434 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-11 18:22:20,049 INFO L435 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-11 18:22:20,050 INFO L436 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-11 18:22:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 18:22:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 18:22:20,054 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-11 18:22:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-11 18:22:20,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-11 18:22:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-11 18:22:20,056 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-11 18:22:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-11 18:22:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 18:22:20,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:20,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:20,063 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 (5)] Ended with exit code 0 [2024-11-11 18:22:20,258 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-11 18:22:20,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-11 18:22:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149703471] [2024-11-11 18:22:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:20,260 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-11 18:22:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:20,263 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-11 18:22:20,264 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-11 18:22:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:20,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 18:22:20,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:20,416 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-11 18:22:20,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:20,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149703471] [2024-11-11 18:22:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149703471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:22:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276274082] [2024-11-11 18:22:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:22:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:22:20,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:22:20,421 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-11 18:22:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:20,469 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-11 18:22:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:22:20,472 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-11 18:22:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:20,473 INFO L225 Difference]: With dead ends: 32 [2024-11-11 18:22:20,473 INFO L226 Difference]: Without dead ends: 29 [2024-11-11 18:22:20,473 INFO L434 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-11 18:22:20,474 INFO L435 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-11 18:22:20,476 INFO L436 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-11 18:22:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-11 18:22:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-11 18:22:20,485 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-11 18:22:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-11 18:22:20,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-11 18:22:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-11 18:22:20,486 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-11 18:22:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-11 18:22:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 18:22:20,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:20,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:20,495 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-11 18:22:20,691 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-11 18:22:20,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-11 18:22:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042849920] [2024-11-11 18:22:20,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:20,694 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-11 18:22:20,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:20,697 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-11 18:22:20,698 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-11 18:22:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:22:20,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 18:22:20,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:22:20,889 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-11 18:22:20,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:22:20,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:22:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042849920] [2024-11-11 18:22:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042849920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:22:20,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:22:20,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 18:22:20,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015214772] [2024-11-11 18:22:20,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:22:20,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 18:22:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:22:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 18:22:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 18:22:20,896 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-11 18:22:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:22:21,050 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-11 18:22:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 18:22:21,051 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-11 18:22:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:22:21,052 INFO L225 Difference]: With dead ends: 38 [2024-11-11 18:22:21,052 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 18:22:21,052 INFO L434 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-11 18:22:21,053 INFO L435 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-11 18:22:21,053 INFO L436 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-11 18:22:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 18:22:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 18:22:21,061 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-11 18:22:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-11 18:22:21,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-11 18:22:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:22:21,065 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-11 18:22:21,065 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-11 18:22:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-11 18:22:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 18:22:21,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:22:21,066 INFO L218 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-11 18:22:21,072 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 (7)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:21,267 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-11 18:22:21,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:22:21,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:22:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-11 18:22:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:22:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732035373] [2024-11-11 18:22:21,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:22:21,270 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-11 18:22:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:22:21,274 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-11 18:22:21,277 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-11 18:22:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:21,353 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 18:22:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:22:21,418 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-11 18:22:21,419 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 18:22:21,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:22:21,429 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 (8)] Forceful destruction successful, exit code 0 [2024-11-11 18:22:21,623 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-11 18:22:21,626 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:22:21,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:22:21,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:22:21 BoogieIcfgContainer [2024-11-11 18:22:21,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:22:21,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:22:21,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:22:21,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:22:21,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:22:17" (3/4) ... [2024-11-11 18:22:21,664 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 18:22:21,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 18:22:21,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:22:21,711 INFO L158 Benchmark]: Toolchain (without parser) took 4735.63ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 23.6MB in the beginning and 43.8MB in the end (delta: -20.2MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,711 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 41.9MB. Free memory was 25.7MB in the beginning and 25.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:22:21,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.47ms. Allocated memory is still 54.5MB. Free memory was 23.4MB in the beginning and 24.1MB in the end (delta: -625.4kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 54.5MB. Free memory was 24.1MB in the beginning and 22.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,712 INFO L158 Benchmark]: Boogie Preprocessor took 81.44ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 22.4MB in the beginning and 46.3MB in the end (delta: -23.9MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,712 INFO L158 Benchmark]: RCFGBuilder took 480.89ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 31.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,713 INFO L158 Benchmark]: TraceAbstraction took 3740.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.3MB in the beginning and 45.9MB in the end (delta: -14.6MB). Peak memory consumption was 391.6kB. Max. memory is 16.1GB. [2024-11-11 18:22:21,713 INFO L158 Benchmark]: Witness Printer took 48.21ms. Allocated memory is still 81.8MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:22:21,715 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.93ms. Allocated memory is still 41.9MB. Free memory was 25.7MB in the beginning and 25.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.47ms. Allocated memory is still 54.5MB. Free memory was 23.4MB in the beginning and 24.1MB in the end (delta: -625.4kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 54.5MB. Free memory was 24.1MB in the beginning and 22.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.44ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 22.4MB in the beginning and 46.3MB in the end (delta: -23.9MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.89ms. Allocated memory is still 67.1MB. Free memory was 46.3MB in the beginning and 31.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3740.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 31.3MB in the beginning and 45.9MB in the end (delta: -14.6MB). Peak memory consumption was 391.6kB. Max. memory is 16.1GB. * Witness Printer took 48.21ms. Allocated memory is still 81.8MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.2MB). 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: 72]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L38] COND FALSE !(__fpclassify_float(x) == 0) [L40] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L40] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L40] COND FALSE !(__fpclassify_float(y) == 0) [L43] return x < y ? x : y; VAL [\result=0.0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0.0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] CALL, EXPR __signbit_float(res) [L47] __uint32_t w; VAL [x=0.0] [L50] ieee_float_shape_type gf_u; [L51] gf_u.value = (x) [L52] EXPR gf_u.word [L52] (w) = gf_u.word [L55] return (w & 0x80000000) != 0; VAL [\result=0, x=0.0] [L71] RET, EXPR __signbit_float(res) [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, 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.3s 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 280 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-11 18:22:21,747 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE