./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1300.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/double_req_bl_1300.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 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:12:28,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:12:28,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 05:12:28,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:12:28,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:12:28,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:12:28,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:12:28,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:12:28,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:12:28,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:12:28,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:12:28,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:12:28,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:12:28,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:12:28,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:12:28,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:12:28,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:12:28,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:12:28,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 05:12:28,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:12:28,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:12:28,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:12:28,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:12:28,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:12:28,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:12:28,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:12:28,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:12:28,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:12:28,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:12:28,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:12:28,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:12:28,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:12:28,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:28,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:12:28,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:12:28,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:12:28,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 05:12:28,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 05:12:28,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:12:28,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:12:28,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:12:28,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:12:28,435 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2024-11-16 05:12:28,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:12:28,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:12:28,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:12:28,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:12:28,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:12:28,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-11-16 05:12:30,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:12:30,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:12:30,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-11-16 05:12:30,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b99244a/db6f3e924df740f58ea821d33c406d97/FLAG897533e7a [2024-11-16 05:12:30,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1b99244a/db6f3e924df740f58ea821d33c406d97 [2024-11-16 05:12:30,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:12:30,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:12:30,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:30,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:12:30,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:12:30,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5114c12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30, skipping insertion in model container [2024-11-16 05:12:30,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:12:30,771 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/double_req_bl_1300.c[1563,1576] [2024-11-16 05:12:30,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:30,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:12:30,810 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/double_req_bl_1300.c[1563,1576] [2024-11-16 05:12:30,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:30,829 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:12:30,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30 WrapperNode [2024-11-16 05:12:30,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:30,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:30,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:12:30,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:12:30,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,869 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2024-11-16 05:12:30,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:30,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:12:30,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:12:30,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:12:30,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,906 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-16 05:12:30,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:12:30,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:12:30,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:12:30,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:12:30,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (1/1) ... [2024-11-16 05:12:30,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:30,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:12:30,972 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-16 05:12:30,975 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-16 05:12:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:12:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 05:12:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 05:12:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 05:12:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:12:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 05:12:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:12:31,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 05:12:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:12:31,150 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:12:31,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:12:31,527 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: havoc isinf_double_#t~bitwise8#1; [2024-11-16 05:12:31,557 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 05:12:31,559 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:12:31,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:12:31,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:12:31,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:31 BoogieIcfgContainer [2024-11-16 05:12:31,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:12:31,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:12:31,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:12:31,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:12:31,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:12:30" (1/3) ... [2024-11-16 05:12:31,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96edac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:31, skipping insertion in model container [2024-11-16 05:12:31,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:30" (2/3) ... [2024-11-16 05:12:31,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96edac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:31, skipping insertion in model container [2024-11-16 05:12:31,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:31" (3/3) ... [2024-11-16 05:12:31,611 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2024-11-16 05:12:31,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:12:31,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:12:31,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:12:31,710 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;@4eec1180, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:12:31,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:12:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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-16 05:12:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:12:31,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:31,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:31,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1490421978, now seen corresponding path program 1 times [2024-11-16 05:12:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101406614] [2024-11-16 05:12:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:31,943 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-16 05:12:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101406614] [2024-11-16 05:12:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101406614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:12:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028435875] [2024-11-16 05:12:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:31,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:12:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:31,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:12:31,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:12:31,985 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-16 05:12:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:32,020 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2024-11-16 05:12:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:12:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) Word has length 17 [2024-11-16 05:12:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:32,031 INFO L225 Difference]: With dead ends: 61 [2024-11-16 05:12:32,031 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:32,036 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-16 05:12:32,040 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:32,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 05:12:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-16 05:12:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-16 05:12:32,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2024-11-16 05:12:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:32,089 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-16 05:12:32,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-16 05:12:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-16 05:12:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 05:12:32,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:32,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 05:12:32,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash -535717256, now seen corresponding path program 1 times [2024-11-16 05:12:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674550675] [2024-11-16 05:12:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:32,287 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-16 05:12:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674550675] [2024-11-16 05:12:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674550675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:32,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:12:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869111525] [2024-11-16 05:12:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:32,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:12:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:12:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:32,291 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-16 05:12:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:32,312 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-16 05:12:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:12:32,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2024-11-16 05:12:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:32,314 INFO L225 Difference]: With dead ends: 35 [2024-11-16 05:12:32,314 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:32,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:32,316 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:32,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:32,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 05:12:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-16 05:12:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-16 05:12:32,321 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2024-11-16 05:12:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:32,321 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-16 05:12:32,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-16 05:12:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-16 05:12:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 05:12:32,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:32,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:32,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 05:12:32,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash -890973523, now seen corresponding path program 1 times [2024-11-16 05:12:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558975149] [2024-11-16 05:12:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:32,789 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-16 05:12:32,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558975149] [2024-11-16 05:12:32,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558975149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:32,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:32,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071578782] [2024-11-16 05:12:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:32,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:32,794 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 05:12:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:32,865 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-16 05:12:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2024-11-16 05:12:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:32,868 INFO L225 Difference]: With dead ends: 43 [2024-11-16 05:12:32,869 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 05:12:32,870 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-16 05:12:32,871 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:32,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:12:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 05:12:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-16 05:12:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-16 05:12:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-16 05:12:32,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2024-11-16 05:12:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:32,880 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-16 05:12:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-16 05:12:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-16 05:12:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 05:12:32,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:32,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:32,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 05:12:32,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1034986620, now seen corresponding path program 1 times [2024-11-16 05:12:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789920871] [2024-11-16 05:12:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:33,148 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-16 05:12:33,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789920871] [2024-11-16 05:12:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789920871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:12:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806755965] [2024-11-16 05:12:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:12:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:12:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:33,155 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-16 05:12:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:33,196 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-16 05:12:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:12:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 21 [2024-11-16 05:12:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:33,199 INFO L225 Difference]: With dead ends: 42 [2024-11-16 05:12:33,201 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 05:12:33,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 05:12:33,202 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:33,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 05:12:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-11-16 05:12:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 05:12:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-16 05:12:33,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2024-11-16 05:12:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:33,211 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-16 05:12:33,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-16 05:12:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-16 05:12:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 05:12:33,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:33,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 05:12:33,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 679065489, now seen corresponding path program 1 times [2024-11-16 05:12:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084092416] [2024-11-16 05:12:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:12:33,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:12:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:12:33,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 05:12:33,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:12:33,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:12:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 05:12:33,354 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 05:12:33,383 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:12:33,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:12:33 BoogieIcfgContainer [2024-11-16 05:12:33,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:12:33,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:12:33,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:12:33,390 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:12:33,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:31" (3/4) ... [2024-11-16 05:12:33,396 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 05:12:33,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:12:33,399 INFO L158 Benchmark]: Toolchain (without parser) took 2832.83ms. Allocated memory is still 155.2MB. Free memory was 122.8MB in the beginning and 54.0MB in the end (delta: 68.8MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,399 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:33,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.25ms. Allocated memory is still 155.2MB. Free memory was 122.8MB in the beginning and 110.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.33ms. Allocated memory is still 155.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,400 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,401 INFO L158 Benchmark]: IcfgBuilder took 675.60ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 115.4MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,401 INFO L158 Benchmark]: TraceAbstraction took 1789.52ms. Allocated memory is still 155.2MB. Free memory was 114.3MB in the beginning and 55.1MB in the end (delta: 59.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-16 05:12:33,402 INFO L158 Benchmark]: Witness Printer took 7.43ms. Allocated memory is still 155.2MB. Free memory was 55.1MB in the beginning and 54.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:33,403 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.69ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.25ms. Allocated memory is still 155.2MB. Free memory was 122.8MB in the beginning and 110.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.33ms. Allocated memory is still 155.2MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 106.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 675.60ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 115.4MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1789.52ms. Allocated memory is still 155.2MB. Free memory was 114.3MB in the beginning and 55.1MB in the end (delta: 59.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 7.43ms. Allocated memory is still 155.2MB. Free memory was 55.1MB in the beginning and 54.0MB in the end (delta: 1.0MB). 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: 61]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of bitwiseOr at line 29, overapproximation of to_real at line 57. Possible FailurePath: [L52] double x = __VERIFIER_nondet_double(); [L55] CALL, EXPR isinf_double(x) [L19] __int32_t hx, lx; VAL [x=2147483662] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L25] COND FALSE !(0) VAL [hx=-2147483648, lx=0, x=2147483662] [L26] hx &= 0x7fffffff VAL [hx=0, lx=0, x=2147483662] [L27] EXPR lx | (-lx) VAL [hx=0, x=2147483662] [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx VAL [hx=2146435072, x=2147483662] [L29] EXPR hx | (-hx) VAL [x=2147483662] [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L55] RET, EXPR isinf_double(x) [L55] !isinf_double(x) && !isnan_double(x) [L55] CALL, EXPR isnan_double(x) [L33] return x != x; VAL [\result=0] [L55] RET, EXPR isnan_double(x) [L55] !isinf_double(x) && !isnan_double(x) VAL [x=2147483662] [L55] COND TRUE !isinf_double(x) && !isnan_double(x) [L57] CALL, EXPR isfinite_double(x) [L36] __int32_t hx; VAL [x=2147483662] [L38] ieee_double_shape_type gh_u; [L39] gh_u.value = (x) [L40] EXPR gh_u.parts.msw [L40] (hx) = gh_u.parts.msw [L41] COND FALSE !(0) VAL [hx=0, x=2147483662] [L42] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\result=1, x=2147483662] [L57] RET, EXPR isfinite_double(x) [L57] double res = isfinite_double(x); [L60] COND TRUE res == 0.0 [L61] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 118 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-16 05:12:33,431 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/double_req_bl_1300.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 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:12:35,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:12:35,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 05:12:35,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:12:35,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:12:35,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:12:35,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:12:35,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:12:35,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:12:35,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:12:35,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:12:35,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:12:35,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:12:35,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:12:35,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:12:35,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:12:35,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:12:35,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:12:35,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:12:35,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:12:35,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:12:35,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:12:35,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:12:35,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 05:12:35,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 05:12:35,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:12:35,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 05:12:35,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:12:35,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:12:35,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:12:35,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:12:35,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:12:35,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:12:35,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:12:35,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:35,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:12:35,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:12:35,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:12:35,986 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 05:12:35,986 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 05:12:35,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:12:35,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:12:35,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:12:35,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:12:35,988 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2024-11-16 05:12:36,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:12:36,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:12:36,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:12:36,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:12:36,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:12:36,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-11-16 05:12:38,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:12:38,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:12:38,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2024-11-16 05:12:38,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8706dcc4f/e880da3c2e2f440ca420c9174f15b4cf/FLAGbfb8649db [2024-11-16 05:12:38,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8706dcc4f/e880da3c2e2f440ca420c9174f15b4cf [2024-11-16 05:12:38,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:12:38,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:12:38,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:38,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:12:38,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:12:38,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b744dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38, skipping insertion in model container [2024-11-16 05:12:38,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:12:38,615 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/double_req_bl_1300.c[1563,1576] [2024-11-16 05:12:38,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:38,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:12:38,667 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/double_req_bl_1300.c[1563,1576] [2024-11-16 05:12:38,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:38,695 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:12:38,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38 WrapperNode [2024-11-16 05:12:38,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:38,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:38,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:12:38,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:12:38,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,748 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-11-16 05:12:38,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:38,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:12:38,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:12:38,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:12:38,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,781 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-16 05:12:38,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:12:38,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:12:38,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:12:38,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:12:38,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (1/1) ... [2024-11-16 05:12:38,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:12:38,861 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-16 05:12:38,865 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-16 05:12:38,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:12:38,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 05:12:38,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 05:12:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-16 05:12:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 05:12:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 05:12:38,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 05:12:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:12:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 05:12:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 05:12:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 05:12:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:12:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:12:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:12:39,041 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:12:39,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:12:39,870 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-16 05:12:39,870 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:12:39,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:12:39,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:12:39,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:39 BoogieIcfgContainer [2024-11-16 05:12:39,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:12:39,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:12:39,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:12:39,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:12:39,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:12:38" (1/3) ... [2024-11-16 05:12:39,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c7514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:39, skipping insertion in model container [2024-11-16 05:12:39,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:38" (2/3) ... [2024-11-16 05:12:39,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c7514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:39, skipping insertion in model container [2024-11-16 05:12:39,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:39" (3/3) ... [2024-11-16 05:12:39,895 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2024-11-16 05:12:39,909 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:12:39,909 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:12:39,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:12:39,967 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;@13ebb1f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:12:39,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:12:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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-16 05:12:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 05:12:39,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:39,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:39,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 963659031, now seen corresponding path program 1 times [2024-11-16 05:12:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:40,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386749553] [2024-11-16 05:12:40,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:40,007 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-16 05:12:40,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:40,012 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-16 05:12:40,025 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-16 05:12:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:40,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 05:12:40,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:40,150 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-16 05:12:40,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:40,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386749553] [2024-11-16 05:12:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386749553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:12:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302240226] [2024-11-16 05:12:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:12:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:12:40,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:12:40,191 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-16 05:12:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:40,210 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-11-16 05:12:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:12:40,213 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), 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) Word has length 12 [2024-11-16 05:12:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:40,220 INFO L225 Difference]: With dead ends: 39 [2024-11-16 05:12:40,220 INFO L226 Difference]: Without dead ends: 16 [2024-11-16 05:12:40,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-16 05:12:40,228 INFO L432 NwaCegarLoop]: 21 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, 21 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-16 05:12:40,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-16 05:12:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-16 05:12:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-16 05:12:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 05:12:40,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-11-16 05:12:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 05:12:40,255 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), 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-16 05:12:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 05:12:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 05:12:40,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:40,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:40,260 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-16 05:12:40,457 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-16 05:12:40,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -367723566, now seen corresponding path program 1 times [2024-11-16 05:12:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388938304] [2024-11-16 05:12:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:40,459 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-16 05:12:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:40,463 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-16 05:12:40,465 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-16 05:12:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:40,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 05:12:40,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:40,598 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-16 05:12:40,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:40,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388938304] [2024-11-16 05:12:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388938304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:40,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:12:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310794402] [2024-11-16 05:12:40,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:40,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:12:40,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:12:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:40,605 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 05:12:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:40,625 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-11-16 05:12:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:12:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2024-11-16 05:12:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:40,626 INFO L225 Difference]: With dead ends: 24 [2024-11-16 05:12:40,627 INFO L226 Difference]: Without dead ends: 16 [2024-11-16 05:12:40,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:40,628 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:40,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-16 05:12:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-16 05:12:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 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-16 05:12:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-16 05:12:40,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2024-11-16 05:12:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-16 05:12:40,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 05:12:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-16 05:12:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:12:40,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:40,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:40,645 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-16 05:12:40,839 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-16 05:12:40,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:40,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 21863571, now seen corresponding path program 1 times [2024-11-16 05:12:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962006993] [2024-11-16 05:12:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:40,842 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-16 05:12:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:40,843 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-16 05:12:40,845 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-16 05:12:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:40,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 05:12:40,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:45,337 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (and (fp.eq .cse0 .cse0) (= (_ bv0 32) (bvadd (_ bv1 32) (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvlshr (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (bvor (bvneg .cse2) .cse2)) (_ bv31 32)) (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2147483647 32))))))) (bvor .cse1 (bvneg .cse1))) (_ bv31 32))))) (= |c_ULTIMATE.start_isfinite_double_~hx~1#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))) is different from true [2024-11-16 05:12:46,695 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-16 05:12:46,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:46,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:46,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962006993] [2024-11-16 05:12:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962006993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 05:12:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883754115] [2024-11-16 05:12:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:46,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 05:12:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 05:12:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-16 05:12:46,705 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-16 05:12:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:52,046 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-16 05:12:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 05:12:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) Word has length 15 [2024-11-16 05:12:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:52,053 INFO L225 Difference]: With dead ends: 16 [2024-11-16 05:12:52,053 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 05:12:52,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=36, Invalid=176, Unknown=2, NotChecked=26, Total=240 [2024-11-16 05:12:52,055 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:52,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 11 Unchecked, 0.8s Time] [2024-11-16 05:12:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 05:12:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 05:12:52,057 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-16 05:12:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 05:12:52,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-16 05:12:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:52,062 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 05:12:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-16 05:12:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 05:12:52,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 05:12:52,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:12:52,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 05:12:52,266 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-16 05:12:52,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 05:12:52,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 05:12:52,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:12:52,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:12:52 BoogieIcfgContainer [2024-11-16 05:12:52,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:12:52,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:12:52,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:12:52,315 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:12:52,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:39" (3/4) ... [2024-11-16 05:12:52,318 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 05:12:52,326 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-16 05:12:52,327 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 05:12:52,328 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 05:12:52,328 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 05:12:52,489 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 05:12:52,489 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 05:12:52,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:12:52,490 INFO L158 Benchmark]: Toolchain (without parser) took 14153.45ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 27.6MB in the beginning and 71.3MB in the end (delta: -43.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:52,491 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 38.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:52,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.02ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 27.4MB in the beginning and 67.3MB in the end (delta: -39.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-11-16 05:12:52,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:52,492 INFO L158 Benchmark]: Boogie Preprocessor took 64.01ms. Allocated memory is still 96.5MB. Free memory was 65.5MB in the beginning and 63.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:52,492 INFO L158 Benchmark]: IcfgBuilder took 1071.31ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:12:52,493 INFO L158 Benchmark]: TraceAbstraction took 12426.23ms. Allocated memory is still 96.5MB. Free memory was 48.7MB in the beginning and 68.2MB in the end (delta: -19.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:52,493 INFO L158 Benchmark]: Witness Printer took 174.63ms. Allocated memory is still 96.5MB. Free memory was 68.2MB in the beginning and 71.3MB in the end (delta: -3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:52,495 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.30ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 38.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.02ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 27.4MB in the beginning and 67.3MB in the end (delta: -39.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.01ms. Allocated memory is still 96.5MB. Free memory was 65.5MB in the beginning and 63.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1071.31ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 49.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12426.23ms. Allocated memory is still 96.5MB. Free memory was 48.7MB in the beginning and 68.2MB in the end (delta: -19.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 174.63ms. Allocated memory is still 96.5MB. Free memory was 68.2MB in the beginning and 71.3MB in the end (delta: -3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: 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 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 41 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 11 QuantifiedInterpolants, 755 SizeOfPredicates, 5 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Location Invariant Derived location invariant: null - InvariantResult [Line: 37]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 05:12:52,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE