./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_1252a.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 a237c0c5e1786112b53bae8b5da7db35eee15483563deacdbe79fcac787d5645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:10,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:10,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:54:10,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:10,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:10,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:10,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:10,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:10,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:10,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:10,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:10,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:10,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:10,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:10,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:10,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:10,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:10,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:10,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:54:10,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:10,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:10,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:10,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:10,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:10,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:10,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:10,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:10,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:10,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:10,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:10,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:10,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:10,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:10,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:10,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:10,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:10,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:54:10,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:54:10,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:10,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:10,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:10,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:10,613 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 -> a237c0c5e1786112b53bae8b5da7db35eee15483563deacdbe79fcac787d5645 [2024-11-18 11:54:10,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:10,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:10,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:10,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:10,867 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:10,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252a.c [2024-11-18 11:54:12,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:12,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:12,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252a.c [2024-11-18 11:54:12,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662f113e5/5e02c334f2264ff28969d4574fe157c9/FLAGc4d2fcbd2 [2024-11-18 11:54:13,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662f113e5/5e02c334f2264ff28969d4574fe157c9 [2024-11-18 11:54:13,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:13,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:13,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:13,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:13,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:13,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734d0407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13, skipping insertion in model container [2024-11-18 11:54:13,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:13,275 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_1252a.c[1897,1910] [2024-11-18 11:54:13,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:13,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:13,305 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_1252a.c[1897,1910] [2024-11-18 11:54:13,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:13,326 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:13,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13 WrapperNode [2024-11-18 11:54:13,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:13,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:13,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:13,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:13,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,358 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-18 11:54:13,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:13,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:13,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:13,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:13,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,391 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-18 11:54:13,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:13,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:13,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:13,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:13,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (1/1) ... [2024-11-18 11:54:13,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:13,445 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-18 11:54:13,451 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-18 11:54:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:13,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-18 11:54:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:13,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 11:54:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:13,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:13,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:13,704 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:13,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:13,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:13,714 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:13,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:13 BoogieIcfgContainer [2024-11-18 11:54:13,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:13,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:13,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:13,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:13,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:13" (1/3) ... [2024-11-18 11:54:13,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:13, skipping insertion in model container [2024-11-18 11:54:13,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:13" (2/3) ... [2024-11-18 11:54:13,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:13, skipping insertion in model container [2024-11-18 11:54:13,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:13" (3/3) ... [2024-11-18 11:54:13,734 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a.c [2024-11-18 11:54:13,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:13,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:13,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:13,829 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;@3d7019c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:13,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:13,840 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-18 11:54:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:13,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:13,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:13,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:13,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-18 11:54:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868327178] [2024-11-18 11:54:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:13,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:14,010 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-18 11:54:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:14,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868327178] [2024-11-18 11:54:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868327178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:14,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781523297] [2024-11-18 11:54:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:14,038 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:14,056 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-18 11:54:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-18 11:54:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:14,062 INFO L225 Difference]: With dead ends: 55 [2024-11-18 11:54:14,063 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:14,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:14,068 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:14,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:14,097 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-18 11:54:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-18 11:54:14,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-18 11:54:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:14,101 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-18 11:54:14,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-18 11:54:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:14,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:14,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:54:14,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-18 11:54:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424711701] [2024-11-18 11:54:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:14,318 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-18 11:54:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424711701] [2024-11-18 11:54:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424711701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822721123] [2024-11-18 11:54:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,325 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:14,364 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 11:54:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-18 11:54:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:14,366 INFO L225 Difference]: With dead ends: 39 [2024-11-18 11:54:14,366 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 11:54:14,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,367 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:14,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 11:54:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 11:54:14,376 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-18 11:54:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:14,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-18 11:54:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:54:14,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:14,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:54:14,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:14,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-18 11:54:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182174661] [2024-11-18 11:54:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:14,443 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-18 11:54:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182174661] [2024-11-18 11:54:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182174661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:14,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765310210] [2024-11-18 11:54:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,445 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:14,473 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-18 11:54:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:14,475 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:14,475 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:14,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,479 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:14,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:14,485 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-18 11:54:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:14,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-18 11:54:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 11:54:14,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:14,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 11:54:14,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-18 11:54:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694930999] [2024-11-18 11:54:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:14,574 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-18 11:54:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:14,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694930999] [2024-11-18 11:54:14,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694930999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:14,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:14,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010408822] [2024-11-18 11:54:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:14,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,576 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:14,605 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 11:54:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:14,607 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:14,607 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:14,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,608 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:14,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:14,615 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-18 11:54:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:14,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-18 11:54:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:14,617 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:14,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:14,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 11:54:14,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-18 11:54:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615537787] [2024-11-18 11:54:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:14,703 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-18 11:54:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615537787] [2024-11-18 11:54:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615537787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:14,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277705323] [2024-11-18 11:54:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:14,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,707 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:14,726 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-18 11:54:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:14,727 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:14,727 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:14,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:14,729 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:14,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:14,739 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-18 11:54:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:14,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-18 11:54:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:14,743 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:14,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 11:54:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:14,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:14,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 11:54:14,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:14,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-18 11:54:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416368291] [2024-11-18 11:54:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:14,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:54:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:14,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 11:54:14,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:54:14,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 11:54:14,823 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 11:54:14,843 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:14,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:14 BoogieIcfgContainer [2024-11-18 11:54:14,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:14,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:14,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:14,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:14,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:13" (3/4) ... [2024-11-18 11:54:14,851 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 11:54:14,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:14,854 INFO L158 Benchmark]: Toolchain (without parser) took 1803.16ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 86.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-18 11:54:14,855 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 109.1MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:14,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.53ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 132.6MB in the end (delta: -37.2MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-18 11:54:14,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.12ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 131.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:14,855 INFO L158 Benchmark]: Boogie Preprocessor took 54.98ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:14,856 INFO L158 Benchmark]: RCFGBuilder took 304.93ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 113.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 11:54:14,856 INFO L158 Benchmark]: TraceAbstraction took 1125.63ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 86.9MB in the end (delta: 26.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-18 11:54:14,856 INFO L158 Benchmark]: Witness Printer took 6.14ms. Allocated memory is still 167.8MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:14,857 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.52ms. Allocated memory is still 109.1MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.53ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 132.6MB in the end (delta: -37.2MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.12ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 131.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.98ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 129.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.93ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 113.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1125.63ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 86.9MB in the end (delta: 26.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 6.14ms. Allocated memory is still 167.8MB. Free memory is still 86.9MB. 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: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someUnaryFLOAToperation at line 74. Possible FailurePath: [L74] float x = -0.0f; [L75] float y = 0.0f; [L77] CALL, EXPR fmax_float(x, y) [L45] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578698] [L22] __uint32_t w; VAL [\old(x)=4286578698, x=4286578698] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (w) = gf_u.word [L30] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L32-L33] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L35-L36] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L38] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L41] return 0; VAL [\old(x)=4286578698, \result=0, x=4286578698] [L45] RET, EXPR __fpclassify_float(x) VAL [x=4286578698, y=0] [L45] COND TRUE __fpclassify_float(x) == 0 [L46] return y; VAL [\result=0, x=4286578698] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] 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.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 175 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 11:54:14,882 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_1252a.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 a237c0c5e1786112b53bae8b5da7db35eee15483563deacdbe79fcac787d5645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:17,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:17,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 11:54:17,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:17,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:17,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:17,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:17,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:17,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:17,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:17,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:17,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:17,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:17,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:17,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:17,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:17,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:17,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:17,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:17,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:17,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:17,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:17,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:17,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 11:54:17,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 11:54:17,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:17,139 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 11:54:17,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:17,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:17,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:17,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:17,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:17,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:17,141 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 11:54:17,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 11:54:17,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:17,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:17,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:17,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:17,142 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 -> a237c0c5e1786112b53bae8b5da7db35eee15483563deacdbe79fcac787d5645 [2024-11-18 11:54:17,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:17,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:17,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:17,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:17,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:17,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252a.c [2024-11-18 11:54:18,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:19,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:19,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252a.c [2024-11-18 11:54:19,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0449fff26/7672012e6b2b49da923f6fc6c060d433/FLAG19f9f7d11 [2024-11-18 11:54:19,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0449fff26/7672012e6b2b49da923f6fc6c060d433 [2024-11-18 11:54:19,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:19,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:19,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:19,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:19,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:19,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2628648a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19, skipping insertion in model container [2024-11-18 11:54:19,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:19,657 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_1252a.c[1897,1910] [2024-11-18 11:54:19,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:19,670 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:19,689 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_1252a.c[1897,1910] [2024-11-18 11:54:19,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:19,715 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:19,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19 WrapperNode [2024-11-18 11:54:19,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:19,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:19,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:19,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:19,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,752 INFO L138 Inliner]: procedures = 20, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-18 11:54:19,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:19,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:19,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:19,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:19,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,780 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-18 11:54:19,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:19,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:19,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:19,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:19,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (1/1) ... [2024-11-18 11:54:19,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:19,836 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-18 11:54:19,839 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-18 11:54:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 11:54:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 11:54:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-18 11:54:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:19,887 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:19,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:19,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-18 11:54:19,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-18 11:54:19,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:19,982 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:19,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:20,189 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:20,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:20,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:20,203 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:20,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:20 BoogieIcfgContainer [2024-11-18 11:54:20,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:20,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:20,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:20,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:20,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:19" (1/3) ... [2024-11-18 11:54:20,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb099d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:20, skipping insertion in model container [2024-11-18 11:54:20,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:19" (2/3) ... [2024-11-18 11:54:20,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb099d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:20, skipping insertion in model container [2024-11-18 11:54:20,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:20" (3/3) ... [2024-11-18 11:54:20,213 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252a.c [2024-11-18 11:54:20,226 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:20,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:20,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:20,281 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;@3fc40565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:20,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:20,286 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-18 11:54:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:54:20,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:20,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:20,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-18 11:54:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468925087] [2024-11-18 11:54:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:20,313 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-18 11:54:20,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:20,316 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-18 11:54:20,317 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-18 11:54:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:20,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 11:54:20,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:20,405 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-18 11:54:20,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:20,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468925087] [2024-11-18 11:54:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468925087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249097781] [2024-11-18 11:54:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:20,448 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-18 11:54:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:20,467 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-18 11:54:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:20,469 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-18 11:54:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:20,474 INFO L225 Difference]: With dead ends: 51 [2024-11-18 11:54:20,474 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 11:54:20,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:20,482 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:20,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 11:54:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 11:54:20,525 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-18 11:54:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-18 11:54:20,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-18 11:54:20,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-18 11:54:20,528 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-18 11:54:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-18 11:54:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:20,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:20,536 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-18 11:54:20,730 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-18 11:54:20,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:20,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-18 11:54:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636823337] [2024-11-18 11:54:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:20,733 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-18 11:54:20,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:20,736 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-18 11:54:20,738 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-18 11:54:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:20,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:20,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:20,840 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-18 11:54:20,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:20,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636823337] [2024-11-18 11:54:20,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636823337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:20,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:20,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833898053] [2024-11-18 11:54:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:20,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:20,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:20,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:20,848 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-18 11:54:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:20,870 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-18 11:54:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:20,872 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-18 11:54:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:20,874 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:20,874 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:20,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:20,875 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:20,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:20,882 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-18 11:54:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-18 11:54:20,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-18 11:54:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:20,883 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-18 11:54:20,883 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-18 11:54:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-18 11:54:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:20,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:20,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:20,888 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-18 11:54:21,084 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-18 11:54:21,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:21,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-18 11:54:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:21,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665131708] [2024-11-18 11:54:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:21,087 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-18 11:54:21,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:21,088 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-18 11:54:21,090 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-18 11:54:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:21,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 11:54:21,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:21,415 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-18 11:54:21,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:21,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665131708] [2024-11-18 11:54:21,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665131708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:21,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:21,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276557059] [2024-11-18 11:54:21,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:21,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:21,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:21,417 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-18 11:54:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:21,755 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-18 11:54:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:21,756 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-18 11:54:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:21,757 INFO L225 Difference]: With dead ends: 49 [2024-11-18 11:54:21,757 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:21,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:21,759 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:21,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 11:54:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:21,766 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-18 11:54:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-18 11:54:21,767 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-18 11:54:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-18 11:54:21,767 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-18 11:54:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-18 11:54:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:21,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:21,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:21,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 11:54:21,968 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-18 11:54:21,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-18 11:54:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952404606] [2024-11-18 11:54:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:21,969 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-18 11:54:21,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:21,972 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-18 11:54:21,978 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-18 11:54:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:22,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:22,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:22,086 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-18 11:54:22,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:22,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952404606] [2024-11-18 11:54:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952404606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720462865] [2024-11-18 11:54:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:22,088 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-18 11:54:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:22,119 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-18 11:54:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:22,119 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-18 11:54:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:22,120 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:22,120 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:22,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:22,121 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:22,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:22,125 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-18 11:54:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-18 11:54:22,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-18 11:54:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-18 11:54:22,126 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-18 11:54:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-18 11:54:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:22,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:22,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:22,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-18 11:54:22,327 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-18 11:54:22,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-18 11:54:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893955242] [2024-11-18 11:54:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:22,330 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-18 11:54:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:22,331 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-18 11:54:22,334 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-18 11:54:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:22,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:22,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:22,440 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-18 11:54:22,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:22,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893955242] [2024-11-18 11:54:22,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893955242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:22,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:22,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 11:54:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696035095] [2024-11-18 11:54:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:22,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 11:54:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:22,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 11:54:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:54:22,442 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-18 11:54:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:22,472 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-18 11:54:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 11:54:22,473 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-18 11:54:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:22,473 INFO L225 Difference]: With dead ends: 32 [2024-11-18 11:54:22,473 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 11:54:22,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:54:22,474 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:22,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 11:54:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 11:54:22,478 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-18 11:54:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-18 11:54:22,479 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-18 11:54:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:22,480 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-18 11:54:22,480 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-18 11:54:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-18 11:54:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 11:54:22,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:22,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:22,492 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 (6)] Forceful destruction successful, exit code 0 [2024-11-18 11:54:22,684 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-18 11:54:22,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-18 11:54:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154448491] [2024-11-18 11:54:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:22,686 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-18 11:54:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:22,689 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-18 11:54:22,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 11:54:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:22,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:22,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:22,803 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-18 11:54:22,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:22,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154448491] [2024-11-18 11:54:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154448491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366889523] [2024-11-18 11:54:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:22,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:22,805 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-18 11:54:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:22,984 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-18 11:54:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:22,984 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-18 11:54:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:22,985 INFO L225 Difference]: With dead ends: 38 [2024-11-18 11:54:22,985 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 11:54:22,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:22,986 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:22,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 11:54:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-18 11:54:22,988 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-18 11:54:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-18 11:54:22,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-18 11:54:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:22,992 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-18 11:54:22,992 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-18 11:54:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-18 11:54:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:54:22,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:22,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:22,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-18 11:54:23,193 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-18 11:54:23,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-18 11:54:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016733666] [2024-11-18 11:54:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:23,195 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-18 11:54:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:23,198 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-18 11:54:23,206 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-18 11:54:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:23,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 11:54:23,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:23,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 11:54:23,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-18 11:54:23,403 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-18 11:54:23,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:23,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016733666] [2024-11-18 11:54:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016733666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 11:54:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566006966] [2024-11-18 11:54:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:23,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 11:54:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 11:54:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:23,406 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 11:54:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:23,458 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-18 11:54:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 11:54:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 26 [2024-11-18 11:54:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:23,459 INFO L225 Difference]: With dead ends: 21 [2024-11-18 11:54:23,459 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 11:54:23,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-18 11:54:23,460 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 11:54:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 11:54:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:54:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 11:54:23,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-18 11:54:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:23,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 11:54:23,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 11:54:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 11:54:23,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 11:54:23,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:23,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 11:54:23,667 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-18 11:54:23,670 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:23,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 11:54:23,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:23,797 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:54:23,798 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:54:23,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:23 BoogieIcfgContainer [2024-11-18 11:54:23,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:23,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:23,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:23,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:23,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:20" (3/4) ... [2024-11-18 11:54:23,805 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 11:54:23,809 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-11-18 11:54:23,812 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-18 11:54:23,813 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-18 11:54:23,813 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 11:54:23,813 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 11:54:23,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 11:54:23,901 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 11:54:23,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:23,902 INFO L158 Benchmark]: Toolchain (without parser) took 4391.32ms. Allocated memory was 62.9MB in the beginning and 117.4MB in the end (delta: 54.5MB). Free memory was 39.9MB in the beginning and 87.8MB in the end (delta: -47.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,902 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:23,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.71ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 39.8MB in the beginning and 76.9MB in the end (delta: -37.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.90ms. Allocated memory is still 96.5MB. Free memory was 76.9MB in the beginning and 75.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:23,903 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 96.5MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,903 INFO L158 Benchmark]: RCFGBuilder took 400.72ms. Allocated memory is still 96.5MB. Free memory was 72.7MB in the beginning and 58.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,904 INFO L158 Benchmark]: TraceAbstraction took 3595.35ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 92.9MB in the end (delta: -35.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,904 INFO L158 Benchmark]: Witness Printer took 98.93ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 87.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 11:54:23,905 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.71ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 39.8MB in the beginning and 76.9MB in the end (delta: -37.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.90ms. Allocated memory is still 96.5MB. Free memory was 76.9MB in the beginning and 75.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 96.5MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.72ms. Allocated memory is still 96.5MB. Free memory was 72.7MB in the beginning and 58.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3595.35ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 92.9MB in the end (delta: -35.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 98.93ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 87.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 81]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 167 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 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, 128 ConstructedInterpolants, 6 QuantifiedInterpolants, 357 SizeOfPredicates, 11 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-18 11:54:23,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE