./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:51:15,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:51:15,711 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:51:15,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:51:15,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:51:15,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:51:15,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:51:15,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:51:15,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:51:15,749 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:51:15,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:51:15,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:51:15,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:51:15,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:51:15,756 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:51:15,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:51:15,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:51:15,762 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:51:15,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:51:15,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:51:15,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:51:15,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:51:15,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:51:15,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:51:15,765 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:51:15,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:51:15,766 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:51:15,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:51:15,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:51:15,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:51:15,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:51:15,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:15,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:51:15,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:51:15,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:51:15,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:51:15,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:51:15,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:51:15,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:51:15,772 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:51:15,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:51:15,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:51:15,773 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-26 11:51:16,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:51:16,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:51:16,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:51:16,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:51:16,130 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:51:16,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:19,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:51:19,558 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:51:19,559 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:19,569 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/d57c0896e/01d396dafa36440c9f2a703d1a09c37d/FLAG915a51954 [2023-11-26 11:51:19,587 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/d57c0896e/01d396dafa36440c9f2a703d1a09c37d [2023-11-26 11:51:19,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:51:19,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:51:19,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:19,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:51:19,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:51:19,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286c74ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19, skipping insertion in model container [2023-11-26 11:51:19,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,635 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:51:19,835 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-26 11:51:19,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:19,857 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:51:19,874 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-26 11:51:19,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:19,891 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:51:19,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19 WrapperNode [2023-11-26 11:51:19,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:19,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:19,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:51:19,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:51:19,901 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:51:19" (1/1) ... [2023-11-26 11:51:19,908 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:51:19" (1/1) ... [2023-11-26 11:51:19,929 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2023-11-26 11:51:19,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:19,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:51:19,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:51:19,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:51:19,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,962 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:51:19,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:51:19,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:51:19,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:51:19,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:51:19,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (1/1) ... [2023-11-26 11:51:19,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:20,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:20,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:51:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:51:20,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:51:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:51:20,133 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:51:20,135 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:51:20,250 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:51:20,273 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:51:20,273 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:51:20,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:20 BoogieIcfgContainer [2023-11-26 11:51:20,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:51:20,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:51:20,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:51:20,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:51:20,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:51:19" (1/3) ... [2023-11-26 11:51:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cc495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:20, skipping insertion in model container [2023-11-26 11:51:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:19" (2/3) ... [2023-11-26 11:51:20,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cc495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:20, skipping insertion in model container [2023-11-26 11:51:20,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:20" (3/3) ... [2023-11-26 11:51:20,284 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:20,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:51:20,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:51:20,351 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:51:20,358 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;@577896a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:51:20,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:51:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-26 11:51:20,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:20,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:20,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:20,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1205285734, now seen corresponding path program 1 times [2023-11-26 11:51:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:20,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399823139] [2023-11-26 11:51:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:20,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399823139] [2023-11-26 11:51:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399823139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:20,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397977897] [2023-11-26 11:51:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:20,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:20,686 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:51:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:20,752 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-11-26 11:51:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:20,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-26 11:51:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:20,763 INFO L225 Difference]: With dead ends: 21 [2023-11-26 11:51:20,763 INFO L226 Difference]: Without dead ends: 10 [2023-11-26 11:51:20,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:20,773 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:20,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-26 11:51:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-26 11:51:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-26 11:51:20,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2023-11-26 11:51:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:20,815 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-26 11:51:20,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:51:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-11-26 11:51:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-26 11:51:20,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:20,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:20,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:51:20,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:20,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1140391532, now seen corresponding path program 1 times [2023-11-26 11:51:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:20,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714103039] [2023-11-26 11:51:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:20,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:20,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714103039] [2023-11-26 11:51:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714103039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746570142] [2023-11-26 11:51:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:20,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:20,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:51:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:51:21,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:21,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:21,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746570142] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:21,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:21,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-26 11:51:21,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350190679] [2023-11-26 11:51:21,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:21,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:21,086 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:51:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:21,106 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2023-11-26 11:51:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-26 11:51:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:21,108 INFO L225 Difference]: With dead ends: 20 [2023-11-26 11:51:21,108 INFO L226 Difference]: Without dead ends: 13 [2023-11-26 11:51:21,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:21,110 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:21,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-26 11:51:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-26 11:51:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-26 11:51:21,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2023-11-26 11:51:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:21,116 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-26 11:51:21,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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:51:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-26 11:51:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 11:51:21,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:21,118 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:21,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:21,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:21,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:21,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 661964006, now seen corresponding path program 2 times [2023-11-26 11:51:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971446411] [2023-11-26 11:51:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-26 11:51:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971446411] [2023-11-26 11:51:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971446411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:21,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044003965] [2023-11-26 11:51:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:21,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:51:21,489 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:51:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:21,528 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-26 11:51:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:51:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-26 11:51:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:21,533 INFO L225 Difference]: With dead ends: 17 [2023-11-26 11:51:21,533 INFO L226 Difference]: Without dead ends: 13 [2023-11-26 11:51:21,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:21,536 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:21,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-26 11:51:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-26 11:51:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-11-26 11:51:21,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2023-11-26 11:51:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:21,540 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-11-26 11:51:21,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:51:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-11-26 11:51:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-26 11:51:21,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:21,542 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:21,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:51:21,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:21,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 678974667, now seen corresponding path program 1 times [2023-11-26 11:51:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120726264] [2023-11-26 11:51:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120726264] [2023-11-26 11:51:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120726264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739370891] [2023-11-26 11:51:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:21,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:21,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:21,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:51:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:51:21,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:21,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:21,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739370891] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:21,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-26 11:51:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980331547] [2023-11-26 11:51:21,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:21,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:51:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:51:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:51:21,857 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:21,882 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-11-26 11:51:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:51:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-26 11:51:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:21,884 INFO L225 Difference]: With dead ends: 26 [2023-11-26 11:51:21,884 INFO L226 Difference]: Without dead ends: 19 [2023-11-26 11:51:21,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:51:21,886 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:21,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-26 11:51:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-26 11:51:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-11-26 11:51:21,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2023-11-26 11:51:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:21,892 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-11-26 11:51:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-11-26 11:51:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-26 11:51:21,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:21,893 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:21,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:22,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-26 11:51:22,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:22,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 203278091, now seen corresponding path program 2 times [2023-11-26 11:51:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674062110] [2023-11-26 11:51:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674062110] [2023-11-26 11:51:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674062110] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43552178] [2023-11-26 11:51:22,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:51:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:22,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:22,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:51:22,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:51:22,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:22,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-26 11:51:22,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:22,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:22,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43552178] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:22,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-11-26 11:51:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186609006] [2023-11-26 11:51:22,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-26 11:51:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-26 11:51:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:51:22,943 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:51:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:22,997 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2023-11-26 11:51:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-26 11:51:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-26 11:51:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:22,998 INFO L225 Difference]: With dead ends: 38 [2023-11-26 11:51:22,999 INFO L226 Difference]: Without dead ends: 31 [2023-11-26 11:51:22,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:51:23,000 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:23,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-26 11:51:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-26 11:51:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-11-26 11:51:23,015 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 17 [2023-11-26 11:51:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:23,015 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-11-26 11:51:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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:51:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-11-26 11:51:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:51:23,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:23,017 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:23,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:23,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:23,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:23,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 767597451, now seen corresponding path program 3 times [2023-11-26 11:51:23,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35408571] [2023-11-26 11:51:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35408571] [2023-11-26 11:51:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35408571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185304347] [2023-11-26 11:51:23,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:51:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:23,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:23,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:51:23,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-11-26 11:51:23,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:23,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-26 11:51:23,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:24,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185304347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:24,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2023-11-26 11:51:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377061123] [2023-11-26 11:51:24,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-26 11:51:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-26 11:51:25,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2023-11-26 11:51:25,000 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 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:51:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:25,097 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2023-11-26 11:51:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-26 11:51:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-26 11:51:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:25,100 INFO L225 Difference]: With dead ends: 62 [2023-11-26 11:51:25,100 INFO L226 Difference]: Without dead ends: 55 [2023-11-26 11:51:25,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2023-11-26 11:51:25,105 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:25,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:51:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-26 11:51:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-26 11:51:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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:51:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2023-11-26 11:51:25,119 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 29 [2023-11-26 11:51:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:25,122 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2023-11-26 11:51:25,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 47 states have internal predecessors, (53), 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:51:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2023-11-26 11:51:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-26 11:51:25,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:25,124 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:25,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-26 11:51:25,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-26 11:51:25,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:25,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1563032437, now seen corresponding path program 4 times [2023-11-26 11:51:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754529482] [2023-11-26 11:51:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754529482] [2023-11-26 11:51:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754529482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4196911] [2023-11-26 11:51:27,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 11:51:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:27,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:27,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 11:51:27,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 11:51:27,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:27,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-26 11:51:27,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:27,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:30,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4196911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:30,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2023-11-26 11:51:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191025804] [2023-11-26 11:51:30,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:30,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-11-26 11:51:30,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-11-26 11:51:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2023-11-26 11:51:30,822 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 95 states have internal predecessors, (101), 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:51:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:31,004 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2023-11-26 11:51:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-26 11:51:31,005 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 95 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-26 11:51:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:31,008 INFO L225 Difference]: With dead ends: 110 [2023-11-26 11:51:31,009 INFO L226 Difference]: Without dead ends: 103 [2023-11-26 11:51:31,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2023-11-26 11:51:31,015 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:31,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:51:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-26 11:51:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-26 11:51:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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:51:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2023-11-26 11:51:31,033 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 53 [2023-11-26 11:51:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:31,034 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2023-11-26 11:51:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 95 states have internal predecessors, (101), 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:51:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2023-11-26 11:51:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-26 11:51:31,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:31,043 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:31,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:31,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:31,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:31,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1077946741, now seen corresponding path program 5 times [2023-11-26 11:51:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686241876] [2023-11-26 11:51:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686241876] [2023-11-26 11:51:37,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686241876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:51:37,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582851364] [2023-11-26 11:51:37,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-26 11:51:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:37,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:51:37,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 11:51:37,845 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-11-26 11:51:37,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:37,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-26 11:51:37,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:38,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:51:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582851364] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:51:43,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:51:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 101 [2023-11-26 11:51:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879383386] [2023-11-26 11:51:43,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:51:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2023-11-26 11:51:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2023-11-26 11:51:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2023-11-26 11:51:43,033 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 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:51:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:43,200 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-11-26 11:51:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-26 11:51:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-11-26 11:51:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:43,208 INFO L225 Difference]: With dead ends: 116 [2023-11-26 11:51:43,208 INFO L226 Difference]: Without dead ends: 109 [2023-11-26 11:51:43,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 106 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2023-11-26 11:51:43,213 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:43,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:51:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-26 11:51:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-26 11:51:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 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:51:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2023-11-26 11:51:43,233 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 101 [2023-11-26 11:51:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:43,236 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2023-11-26 11:51:43,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 101 states have internal predecessors, (108), 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:51:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2023-11-26 11:51:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-26 11:51:43,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:43,244 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:43,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:43,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:51:43,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:43,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2102593333, now seen corresponding path program 6 times [2023-11-26 11:51:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840840603] [2023-11-26 11:51:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:51:43,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:51:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:51:43,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:51:43,615 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:51:43,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:51:43,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:51:43,622 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2023-11-26 11:51:43,626 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:51:43,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:51:43 BoogieIcfgContainer [2023-11-26 11:51:43,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:51:43,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:51:43,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:51:43,718 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:51:43,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:20" (3/4) ... [2023-11-26 11:51:43,720 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:51:43,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:51:43,722 INFO L158 Benchmark]: Toolchain (without parser) took 24127.28ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 100.6MB in the beginning and 171.4MB in the end (delta: -70.8MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,723 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:43,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.29ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 89.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.74ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,724 INFO L158 Benchmark]: Boogie Preprocessor took 58.44ms. Allocated memory is still 138.4MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,725 INFO L158 Benchmark]: RCFGBuilder took 284.69ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 77.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,725 INFO L158 Benchmark]: TraceAbstraction took 23440.38ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 76.6MB in the beginning and 171.4MB in the end (delta: -94.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-11-26 11:51:43,725 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 243.3MB. Free memory is still 171.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:43,727 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.31ms. Allocated memory is still 107.0MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.29ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 89.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.74ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 88.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.44ms. Allocated memory is still 138.4MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.69ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 77.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23440.38ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 76.6MB in the beginning and 171.4MB in the end (delta: -94.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 243.3MB. Free memory is still 171.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: 41]: 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 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19. Possible FailurePath: [L1] int __return_main; [L9] double main__x0; [L10] double main__x1; [L11] double main__x2; [L12] int main__i; [L13] main__x0 = 5.5 [L14] main__x1 = 5.545454545454546 [L15] main__i = 0 VAL [__return_main=0, main__i=0, main__x0=11/2, main__x1=2772727272727273/500000000000000] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x0=2772727272727273/500000000000000, main__x1=153, main__x2=153] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x0=153, main__x1=143, main__x2=143] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x0=143, main__x1=117, main__x2=117] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x0=117, main__x1=115, main__x2=115] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x0=115, main__x1=110, main__x2=110] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x0=110, main__x1=168, main__x2=168] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x0=168, main__x1=198, main__x2=198] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x0=198, main__x1=180, main__x2=180] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x0=180, main__x1=155, main__x2=155] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x0=155, main__x1=118, main__x2=118] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x0=118, main__x1=135, main__x2=135] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x0=135, main__x1=145, main__x2=145] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x0=145, main__x1=162, main__x2=162] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x0=162, main__x1=182, main__x2=182] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x0=182, main__x1=109, main__x2=109] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x0=109, main__x1=158, main__x2=158] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x0=158, main__x1=157, main__x2=157] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x0=157, main__x1=138, main__x2=138] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x0=138, main__x1=136, main__x2=136] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x0=136, main__x1=156, main__x2=156] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x0=156, main__x1=140, main__x2=140] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x0=140, main__x1=124, main__x2=124] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x0=124, main__x1=128, main__x2=128] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x0=128, main__x1=196, main__x2=196] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x0=196, main__x1=144, main__x2=144] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x0=144, main__x1=119, main__x2=119] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x0=119, main__x1=108, main__x2=108] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x0=108, main__x1=111, main__x2=111] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x0=111, main__x1=195, main__x2=195] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x0=195, main__x1=176, main__x2=176] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x0=176, main__x1=146, main__x2=146] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x0=146, main__x1=187, main__x2=187] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x0=187, main__x1=172, main__x2=172] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x0=172, main__x1=169, main__x2=169] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x0=169, main__x1=139, main__x2=139] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x0=139, main__x1=120, main__x2=120] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x0=120, main__x1=185, main__x2=185] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x0=185, main__x1=192, main__x2=192] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x0=192, main__x1=197, main__x2=197] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x0=197, main__x1=160, main__x2=160] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x0=160, main__x1=116, main__x2=116] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x0=116, main__x1=179, main__x2=179] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x0=179, main__x1=163, main__x2=163] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x0=163, main__x1=148, main__x2=148] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x0=148, main__x1=199, main__x2=199] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x0=199, main__x1=106, main__x2=106] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x0=106, main__x1=161, main__x2=161] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x0=161, main__x1=189, main__x2=189] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x0=189, main__x1=125, main__x2=125] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x0=125, main__x1=188, main__x2=188] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x0=188, main__x1=123, main__x2=123] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x0=123, main__x1=130, main__x2=130] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x0=130, main__x1=181, main__x2=181] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x0=181, main__x1=121, main__x2=121] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x0=121, main__x1=166, main__x2=166] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x0=166, main__x1=191, main__x2=191] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x0=191, main__x1=173, main__x2=173] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x0=173, main__x1=151, main__x2=151] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x0=151, main__x1=152, main__x2=152] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x0=152, main__x1=154, main__x2=154] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x0=154, main__x1=171, main__x2=171] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x0=171, main__x1=174, main__x2=174] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x0=174, main__x1=184, main__x2=184] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x0=184, main__x1=127, main__x2=127] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x0=127, main__x1=190, main__x2=190] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x0=190, main__x1=112, main__x2=112] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x0=112, main__x1=193, main__x2=193] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x0=193, main__x1=126, main__x2=126] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x0=126, main__x1=183, main__x2=183] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x0=183, main__x1=107, main__x2=107] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x0=107, main__x1=194, main__x2=194] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x0=194, main__x1=200, main__x2=200] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x0=200, main__x1=170, main__x2=170] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x0=170, main__x1=142, main__x2=142] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x0=142, main__x1=147, main__x2=147] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x0=147, main__x1=149, main__x2=149] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x0=149, main__x1=133, main__x2=133] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x0=133, main__x1=201, main__x2=201] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x0=201, main__x1=202, main__x2=202] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x0=202, main__x1=186, main__x2=186] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x0=186, main__x1=175, main__x2=175] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x0=175, main__x1=167, main__x2=167] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x0=167, main__x1=134, main__x2=134] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x0=134, main__x1=164, main__x2=164] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x0=164, main__x1=165, main__x2=165] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x0=165, main__x1=178, main__x2=178] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x0=178, main__x1=131, main__x2=131] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x0=131, main__x1=114, main__x2=114] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x0=114, main__x1=113, main__x2=113] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x0=113, main__x1=122, main__x2=122] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x0=122, main__x1=132, main__x2=132] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x0=132, main__x1=177, main__x2=177] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x0=177, main__x1=141, main__x2=141] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x0=141, main__x1=105, main__x2=105] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x0=105, main__x1=150, main__x2=150] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x0=150, main__x1=204, main__x2=204] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x0=204, main__x1=159, main__x2=159] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x0=159, main__x1=129, main__x2=129] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x0=129, main__x1=137, main__x2=137] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L17] COND FALSE !(main__i < 100) [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L28] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L53] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L35] int __tmp_1; [L36] __tmp_1 = main____CPAchecker_TMP_0 [L37] int __VERIFIER_assert__cond; [L38] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L39] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] [L41] reach_error() VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=137, main__x1=203, main__x2=203] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 9, TraceHistogramMax: 100, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 68 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 252 SyntacticMatches, 90 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 295, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10/17605 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:51:43,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:51:46,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:51:46,531 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:51:46,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:51:46,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:51:46,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:51:46,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:51:46,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:51:46,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:51:46,594 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:51:46,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:51:46,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:51:46,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:51:46,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:51:46,599 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:51:46,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:51:46,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:51:46,601 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:51:46,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:51:46,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:51:46,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:51:46,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:51:46,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:51:46,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:51:46,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:51:46,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:51:46,606 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:51:46,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:51:46,606 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:51:46,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:51:46,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:51:46,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:51:46,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:51:46,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:46,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:51:46,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:51:46,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:51:46,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:51:46,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:51:46,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:51:46,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:51:46,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:51:46,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:51:46,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:51:46,614 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:51:46,614 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-26 11:51:47,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:51:47,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:51:47,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:51:47,042 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:51:47,042 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:51:47,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:50,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:51:50,507 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:51:50,508 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:50,516 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/00af2dc83/ee3bff5efc464bcb893561593ab014d9/FLAG63fac2e4b [2023-11-26 11:51:50,530 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/data/00af2dc83/ee3bff5efc464bcb893561593ab014d9 [2023-11-26 11:51:50,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:51:50,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:51:50,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:50,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:51:50,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:51:50,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c2721b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50, skipping insertion in model container [2023-11-26 11:51:50,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,565 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:51:50,725 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-26 11:51:50,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:50,747 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:51:50,765 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_d83a1f68-9254-49c6-9c3c-da00be9f6c35/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-26 11:51:50,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:50,784 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:51:50,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50 WrapperNode [2023-11-26 11:51:50,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:50,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:50,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:51:50,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:51:50,794 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:51:50" (1/1) ... [2023-11-26 11:51:50,804 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:51:50" (1/1) ... [2023-11-26 11:51:50,826 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-11-26 11:51:50,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:50,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:51:50,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:51:50,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:51:50,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,857 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:51:50,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:51:50,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:51:50,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:51:50,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:51:50,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (1/1) ... [2023-11-26 11:51:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:50,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:50,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:50,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:51:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:51:50,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:51:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:51:51,064 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:51:51,067 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:51:56,066 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:51:56,095 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:51:56,101 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:51:56,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:56 BoogieIcfgContainer [2023-11-26 11:51:56,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:51:56,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:51:56,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:51:56,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:51:56,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:51:50" (1/3) ... [2023-11-26 11:51:56,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5499f14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:56, skipping insertion in model container [2023-11-26 11:51:56,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:50" (2/3) ... [2023-11-26 11:51:56,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5499f14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:56, skipping insertion in model container [2023-11-26 11:51:56,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:56" (3/3) ... [2023-11-26 11:51:56,112 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-26 11:51:56,126 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:51:56,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:51:56,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:51:56,173 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;@548c6d23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:51:56,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:51:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-26 11:51:56,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:56,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:56,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:56,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1205285734, now seen corresponding path program 1 times [2023-11-26 11:51:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:56,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40081857] [2023-11-26 11:51:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:56,206 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:51:56,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:56,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:56,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:51:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:56,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-26 11:51:56,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:56,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:56,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:56,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40081857] [2023-11-26 11:51:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40081857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2816165] [2023-11-26 11:51:56,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:56,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:56,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:56,537 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:52:03,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:52:07,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:52:11,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 11:52:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:52:11,836 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-11-26 11:52:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:52:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-26 11:52:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:52:11,846 INFO L225 Difference]: With dead ends: 21 [2023-11-26 11:52:11,846 INFO L226 Difference]: Without dead ends: 10 [2023-11-26 11:52:11,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:52:11,853 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:52:11,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2023-11-26 11:52:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-26 11:52:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-26 11:52:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:52:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2023-11-26 11:52:11,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2023-11-26 11:52:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:52:11,885 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2023-11-26 11:52:11,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:52:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2023-11-26 11:52:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-26 11:52:11,886 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:52:11,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:52:11,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:52:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:52:12,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:52:12,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:52:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1140391532, now seen corresponding path program 1 times [2023-11-26 11:52:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:52:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624178289] [2023-11-26 11:52:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:52:12,092 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:52:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:52:12,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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:52:12,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d83a1f68-9254-49c6-9c3c-da00be9f6c35/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