./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme --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 184fccc72b69c7eb23b9d3b6c6b06a51b6f3ae888fa77cf8167b62023a6f2308 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:53:33,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:53:33,787 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:53:33,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:53:33,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:53:33,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:53:33,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:53:33,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:53:33,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:53:33,861 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:53:33,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:53:33,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:53:33,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:53:33,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:53:33,867 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:53:33,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:53:33,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:53:33,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:53:33,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:53:33,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:53:33,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:53:33,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:53:33,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:53:33,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:53:33,872 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:53:33,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:53:33,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:53:33,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:53:33,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:53:33,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:53:33,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:53:33,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:53:33,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:53:33,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:53:33,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:53:33,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:53:33,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:53:33,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:53:33,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:53:33,880 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:53:33,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:53:33,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:53:33,881 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme 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 -> 184fccc72b69c7eb23b9d3b6c6b06a51b6f3ae888fa77cf8167b62023a6f2308 [2023-11-26 11:53:34,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:53:34,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:53:34,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:53:34,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:53:34,274 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:53:34,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:37,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:53:37,682 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:53:37,683 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:37,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/b34bda349/13f2907b9e0447f1adda910322b48235/FLAGb356ece76 [2023-11-26 11:53:37,708 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/b34bda349/13f2907b9e0447f1adda910322b48235 [2023-11-26 11:53:37,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:53:37,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:53:37,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:37,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:53:37,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:53:37,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:37" (1/1) ... [2023-11-26 11:53:37,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5ab0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:37, skipping insertion in model container [2023-11-26 11:53:37,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:37" (1/1) ... [2023-11-26 11:53:37,775 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:53:37,975 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i[915,928] [2023-11-26 11:53:38,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:38,060 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:53:38,082 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i[915,928] [2023-11-26 11:53:38,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:38,139 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:53:38,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38 WrapperNode [2023-11-26 11:53:38,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:38,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:38,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:53:38,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:53:38,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,206 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-11-26 11:53:38,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:38,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:53:38,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:53:38,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:53:38,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,246 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:53:38,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:53:38,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:53:38,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:53:38,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:53:38,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (1/1) ... [2023-11-26 11:53:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:53:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:38,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:53:38,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:53:38,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:53:38,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:53:38,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:53:38,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:53:38,488 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:53:38,490 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:53:38,763 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:53:38,806 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:53:38,807 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:53:38,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:38 BoogieIcfgContainer [2023-11-26 11:53:38,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:53:38,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:53:38,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:53:38,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:53:38,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:53:37" (1/3) ... [2023-11-26 11:53:38,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212e0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:38, skipping insertion in model container [2023-11-26 11:53:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:38" (2/3) ... [2023-11-26 11:53:38,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2212e0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:38, skipping insertion in model container [2023-11-26 11:53:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:38" (3/3) ... [2023-11-26 11:53:38,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:38,839 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:53:38,839 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:53:38,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:53:38,899 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35786cdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:53:38,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:53:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:53:38,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:53:38,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:38,916 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:38,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1291186250, now seen corresponding path program 1 times [2023-11-26 11:53:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527848565] [2023-11-26 11:53:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:53:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:53:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:53:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:53:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:53:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:53:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:53:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:53:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:53:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527848565] [2023-11-26 11:53:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527848565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:53:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850381482] [2023-11-26 11:53:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:39,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:53:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:53:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:39,248 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:53:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:39,313 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2023-11-26 11:53:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:53:39,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-26 11:53:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:39,329 INFO L225 Difference]: With dead ends: 65 [2023-11-26 11:53:39,329 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 11:53:39,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:39,342 INFO L413 NwaCegarLoop]: 42 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, 42 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 [2023-11-26 11:53:39,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:53:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 11:53:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 11:53:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:53:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-26 11:53:39,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-26 11:53:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:39,388 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-26 11:53:39,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:53:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-26 11:53:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:53:39,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:39,393 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:39,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:53:39,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:39,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1150844428, now seen corresponding path program 1 times [2023-11-26 11:53:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835145947] [2023-11-26 11:53:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:53:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:53:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:53:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:53:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:53:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:53:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:53:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:53:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:53:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:53:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:53:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835145947] [2023-11-26 11:53:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835145947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:39,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:53:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250689776] [2023-11-26 11:53:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:53:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:53:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:53:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:53:39,906 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:53:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:40,098 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-26 11:53:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:53:40,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-26 11:53:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:40,106 INFO L225 Difference]: With dead ends: 94 [2023-11-26 11:53:40,106 INFO L226 Difference]: Without dead ends: 63 [2023-11-26 11:53:40,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:53:40,110 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:40,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:53:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-26 11:53:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-26 11:53:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:53:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-26 11:53:40,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-26 11:53:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:40,145 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-26 11:53:40,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:53:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-26 11:53:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 11:53:40,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:40,148 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:53:40,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:40,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2041482526, now seen corresponding path program 1 times [2023-11-26 11:53:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:53:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862813960] [2023-11-26 11:53:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:53:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:53:40,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:53:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:53:40,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:53:40,292 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:53:40,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:53:40,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:53:40,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 11:53:40,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:53:40,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:53:40 BoogieIcfgContainer [2023-11-26 11:53:40,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:53:40,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:53:40,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:53:40,358 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:53:40,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:38" (3/4) ... [2023-11-26 11:53:40,361 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:53:40,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:53:40,363 INFO L158 Benchmark]: Toolchain (without parser) took 2650.61ms. Allocated memory is still 213.9MB. Free memory was 181.4MB in the beginning and 92.4MB in the end (delta: 89.0MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,364 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:53:40,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.62ms. Allocated memory is still 213.9MB. Free memory was 181.2MB in the beginning and 174.7MB in the end (delta: 6.5MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,365 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.88ms. Allocated memory is still 213.9MB. Free memory was 174.7MB in the beginning and 172.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,365 INFO L158 Benchmark]: Boogie Preprocessor took 72.97ms. Allocated memory is still 213.9MB. Free memory was 172.6MB in the beginning and 183.6MB in the end (delta: -11.0MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,366 INFO L158 Benchmark]: RCFGBuilder took 523.55ms. Allocated memory is still 213.9MB. Free memory was 183.6MB in the beginning and 167.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,367 INFO L158 Benchmark]: TraceAbstraction took 1547.09ms. Allocated memory is still 213.9MB. Free memory was 166.8MB in the beginning and 92.4MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2023-11-26 11:53:40,367 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 213.9MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:53:40,370 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.27ms. Allocated memory is still 130.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.62ms. Allocated memory is still 213.9MB. Free memory was 181.2MB in the beginning and 174.7MB in the end (delta: 6.5MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.88ms. Allocated memory is still 213.9MB. Free memory was 174.7MB in the beginning and 172.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.97ms. Allocated memory is still 213.9MB. Free memory was 172.6MB in the beginning and 183.6MB in the end (delta: -11.0MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * RCFGBuilder took 523.55ms. Allocated memory is still 213.9MB. Free memory was 183.6MB in the beginning and 167.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1547.09ms. Allocated memory is still 213.9MB. Free memory was 166.8MB in the beginning and 92.4MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 213.9MB. Free memory is still 92.4MB. 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: 19]: 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 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L91] RET updateVariables() [L92] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 81 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:53:40,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme --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 184fccc72b69c7eb23b9d3b6c6b06a51b6f3ae888fa77cf8167b62023a6f2308 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:53:43,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:53:43,389 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:53:43,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:53:43,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:53:43,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:53:43,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:53:43,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:53:43,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:53:43,435 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:53:43,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:53:43,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:53:43,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:53:43,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:53:43,438 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:53:43,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:53:43,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:53:43,440 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:53:43,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:53:43,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:53:43,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:53:43,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:53:43,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:53:43,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:53:43,447 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:53:43,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:53:43,448 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:53:43,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:53:43,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:53:43,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:53:43,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:53:43,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:53:43,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:53:43,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:53:43,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:53:43,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:53:43,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:53:43,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:53:43,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:53:43,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:53:43,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:53:43,455 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:53:43,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:53:43,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:53:43,456 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:53:43,456 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme 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 -> 184fccc72b69c7eb23b9d3b6c6b06a51b6f3ae888fa77cf8167b62023a6f2308 [2023-11-26 11:53:43,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:53:43,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:53:43,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:53:43,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:53:43,911 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:53:43,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:47,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:53:47,348 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:53:47,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:47,361 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/4f45ef9f2/acec033d4632446d8caa90b65a03f296/FLAG88ca0aba4 [2023-11-26 11:53:47,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/data/4f45ef9f2/acec033d4632446d8caa90b65a03f296 [2023-11-26 11:53:47,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:53:47,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:53:47,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:47,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:53:47,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:53:47,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610cec9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47, skipping insertion in model container [2023-11-26 11:53:47,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,441 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:53:47,647 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i[915,928] [2023-11-26 11:53:47,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:47,743 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:53:47,761 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-15.i[915,928] [2023-11-26 11:53:47,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:53:47,816 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:53:47,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47 WrapperNode [2023-11-26 11:53:47,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:53:47,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:47,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:53:47,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:53:47,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,864 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-11-26 11:53:47,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:53:47,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:53:47,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:53:47,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:53:47,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:53:47,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:53:47,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:53:47,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:53:47,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:53:47,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (1/1) ... [2023-11-26 11:53:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:53:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:53:47,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:53:48,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:53:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:53:48,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:53:48,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:53:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:53:48,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:53:48,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:53:48,134 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:53:48,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:53:48,465 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:53:48,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:53:48,521 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:53:48,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:48 BoogieIcfgContainer [2023-11-26 11:53:48,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:53:48,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:53:48,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:53:48,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:53:48,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:53:47" (1/3) ... [2023-11-26 11:53:48,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e02f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:48, skipping insertion in model container [2023-11-26 11:53:48,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:53:47" (2/3) ... [2023-11-26 11:53:48,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731e02f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:53:48, skipping insertion in model container [2023-11-26 11:53:48,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:48" (3/3) ... [2023-11-26 11:53:48,532 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-15.i [2023-11-26 11:53:48,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:53:48,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:53:48,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:53:48,608 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ecf011c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:53:48,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:53:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:53:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:53:48,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:48,628 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:48,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:48,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1291186250, now seen corresponding path program 1 times [2023-11-26 11:53:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:53:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253294224] [2023-11-26 11:53:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:53:48,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:53:48,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:53:48,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:53:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:48,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:53:48,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-26 11:53:48,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:53:48,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:53:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253294224] [2023-11-26 11:53:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253294224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:53:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272064750] [2023-11-26 11:53:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:48,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:53:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:53:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:53:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:48,954 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:53:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:49,003 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2023-11-26 11:53:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:53:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-26 11:53:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:49,015 INFO L225 Difference]: With dead ends: 65 [2023-11-26 11:53:49,015 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 11:53:49,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:53:49,024 INFO L413 NwaCegarLoop]: 42 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, 42 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 [2023-11-26 11:53:49,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:53:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 11:53:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 11:53:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 11:53:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-26 11:53:49,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-26 11:53:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:49,112 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-26 11:53:49,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:53:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-26 11:53:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-26 11:53:49,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:49,119 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:49,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:53:49,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:53:49,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:49,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:49,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1150844428, now seen corresponding path program 1 times [2023-11-26 11:53:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:53:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854102049] [2023-11-26 11:53:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:49,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:53:49,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:53:49,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:53:49,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:53:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:49,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:53:49,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:53:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:53:49,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:53:49,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:53:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854102049] [2023-11-26 11:53:49,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854102049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:53:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:53:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:53:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653494257] [2023-11-26 11:53:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:53:49,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:53:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:53:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:53:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:53:49,752 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:53:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:53:50,022 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-26 11:53:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:53:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-26 11:53:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:53:50,030 INFO L225 Difference]: With dead ends: 94 [2023-11-26 11:53:50,031 INFO L226 Difference]: Without dead ends: 63 [2023-11-26 11:53:50,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:53:50,039 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:53:50,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:53:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-26 11:53:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-26 11:53:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:53:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-26 11:53:50,060 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-26 11:53:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:53:50,061 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-26 11:53:50,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:53:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-26 11:53:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 11:53:50,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:53:50,063 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:53:50,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:53:50,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:53:50,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:53:50,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:53:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2041482526, now seen corresponding path program 1 times [2023-11-26 11:53:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:53:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717781194] [2023-11-26 11:53:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:53:50,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:53:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:53:50,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:53:50,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:53:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:53:50,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-26 11:53:50,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-26 11:54:01,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:01,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717781194] [2023-11-26 11:54:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717781194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-26 11:54:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553305976] [2023-11-26 11:54:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:01,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:54:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:54:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:54:01,771 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:54:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:03,381 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2023-11-26 11:54:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:54:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-11-26 11:54:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:54:03,384 INFO L225 Difference]: With dead ends: 125 [2023-11-26 11:54:03,384 INFO L226 Difference]: Without dead ends: 94 [2023-11-26 11:54:03,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-11-26 11:54:03,387 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 11:54:03,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 154 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 11:54:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-26 11:54:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-11-26 11:54:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-26 11:54:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-11-26 11:54:03,407 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 59 [2023-11-26 11:54:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:54:03,408 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-11-26 11:54:03,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-26 11:54:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-11-26 11:54:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 11:54:03,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:54:03,410 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:03,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:54:03,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:54:03,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:54:03,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1357674845, now seen corresponding path program 1 times [2023-11-26 11:54:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:54:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691998351] [2023-11-26 11:54:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:54:03,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:54:03,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:54:03,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:54:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:03,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:54:03,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:54:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-26 11:54:03,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:54:03,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:54:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691998351] [2023-11-26 11:54:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691998351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:03,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:54:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547057221] [2023-11-26 11:54:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:54:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:54:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:54:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:54:03,901 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:54:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:04,085 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2023-11-26 11:54:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:54:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-26 11:54:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:54:04,087 INFO L225 Difference]: With dead ends: 123 [2023-11-26 11:54:04,088 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:54:04,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:54:04,090 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:54:04,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:54:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:54:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:54:04,092 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) [2023-11-26 11:54:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:54:04,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2023-11-26 11:54:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:54:04,093 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:54:04,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-26 11:54:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:54:04,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:54:04,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:54:04,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:54:04,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:54:04,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 11:54:05,595 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:54:05,595 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:54:05,596 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-26 11:54:05,596 INFO L895 garLoopResultBuilder]: At program point L89-2(lines 89 95) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:54:05,596 INFO L899 garLoopResultBuilder]: For program point L89-3(lines 89 95) no Hoare annotation was computed. [2023-11-26 11:54:05,596 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 11:54:05,597 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 11:54:05,597 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 11:54:05,597 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:54:05,597 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:54:05,598 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 50) no Hoare annotation was computed. [2023-11-26 11:54:05,598 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-26 11:54:05,598 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-11-26 11:54:05,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 11:54:05,598 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-26 11:54:05,599 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 47) no Hoare annotation was computed. [2023-11-26 11:54:05,599 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:54:05,599 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:54:05,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 11:54:05,600 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-26 11:54:05,600 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 11:54:05,600 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-26 11:54:05,600 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:54:05,601 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-26 11:54:05,603 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-26 11:54:05,603 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 62 77) no Hoare annotation was computed. [2023-11-26 11:54:05,603 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 53) no Hoare annotation was computed. [2023-11-26 11:54:05,604 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 53) no Hoare annotation was computed. [2023-11-26 11:54:05,604 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-26 11:54:05,604 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 61) no Hoare annotation was computed. [2023-11-26 11:54:05,604 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 11:54:05,605 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 11:54:05,605 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 11:54:05,605 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 11:54:05,611 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:54:05,614 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:54:05,639 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,640 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,646 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-26 11:54:05,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:54:05 BoogieIcfgContainer [2023-11-26 11:54:05,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:54:05,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:54:05,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:54:05,654 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:54:05,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:53:48" (3/4) ... [2023-11-26 11:54:05,657 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:54:05,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 11:54:05,667 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-26 11:54:05,668 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-26 11:54:05,668 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:54:05,669 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:54:05,779 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:54:05,779 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:54:05,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:54:05,780 INFO L158 Benchmark]: Toolchain (without parser) took 18390.62ms. Allocated memory was 81.8MB in the beginning and 369.1MB in the end (delta: 287.3MB). Free memory was 59.1MB in the beginning and 296.9MB in the end (delta: -237.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,781 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 58.6MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:05,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.93ms. Allocated memory is still 81.8MB. Free memory was 58.8MB in the beginning and 46.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.83ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 44.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,782 INFO L158 Benchmark]: Boogie Preprocessor took 50.73ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 42.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,783 INFO L158 Benchmark]: RCFGBuilder took 605.16ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 54.1MB in the end (delta: -12.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,783 INFO L158 Benchmark]: TraceAbstraction took 17128.37ms. Allocated memory was 81.8MB in the beginning and 369.1MB in the end (delta: 287.3MB). Free memory was 53.4MB in the beginning and 302.2MB in the end (delta: -248.8MB). Peak memory consumption was 214.0MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,784 INFO L158 Benchmark]: Witness Printer took 126.55ms. Allocated memory is still 369.1MB. Free memory was 302.2MB in the beginning and 296.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:54:05,786 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.25ms. Allocated memory is still 81.8MB. Free memory was 58.6MB in the beginning and 58.6MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.93ms. Allocated memory is still 81.8MB. Free memory was 58.8MB in the beginning and 46.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.83ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 44.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.73ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 42.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.16ms. Allocated memory is still 81.8MB. Free memory was 42.1MB in the beginning and 54.1MB in the end (delta: -12.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17128.37ms. Allocated memory was 81.8MB in the beginning and 369.1MB in the end (delta: 287.3MB). Free memory was 53.4MB in the beginning and 302.2MB in the end (delta: -248.8MB). Peak memory consumption was 214.0MB. Max. memory is 16.1GB. * Witness Printer took 126.55ms. Allocated memory is still 369.1MB. Free memory was 302.2MB in the beginning and 296.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 145 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 68 PreInvPairs, 88 NumberOfFragments, 679 HoareAnnotationTreeSize, 68 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 904 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 21 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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: 89]: Loop Invariant Derived loop invariant: (((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2023-11-26 11:54:05,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_455a29bc-a445-4fd9-91f4-40c8d1f91dfc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE