./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i --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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya --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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:27:07,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:27:07,188 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:27:07,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:27:07,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:27:07,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:27:07,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:27:07,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:27:07,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:27:07,219 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:27:07,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:27:07,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:27:07,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:27:07,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:27:07,222 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:27:07,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:27:07,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:27:07,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:27:07,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:27:07,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:27:07,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:27:07,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:27:07,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:27:07,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:27:07,228 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:27:07,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:27:07,229 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:27:07,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:27:07,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:27:07,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:27:07,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:27:07,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:07,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:27:07,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:27:07,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:27:07,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:27:07,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:27:07,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:27:07,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:27:07,233 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:27:07,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:27:07,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:27:07,234 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2023-11-29 04:27:07,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:27:07,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:27:07,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:27:07,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:27:07,480 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:27:07,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:10,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:27:10,417 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:27:10,418 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:10,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/94b6ecb13/6e90bd68e2844953829330e3c6f3eb71/FLAG0ac78fb21 [2023-11-29 04:27:10,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/94b6ecb13/6e90bd68e2844953829330e3c6f3eb71 [2023-11-29 04:27:10,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:27:10,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:27:10,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:10,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:27:10,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:27:10,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2730dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10, skipping insertion in model container [2023-11-29 04:27:10,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,474 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:27:10,595 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2023-11-29 04:27:10,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:10,657 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:27:10,675 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2023-11-29 04:27:10,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:10,702 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:27:10,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10 WrapperNode [2023-11-29 04:27:10,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:10,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:10,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:27:10,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:27:10,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,740 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2023-11-29 04:27:10,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:10,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:27:10,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:27:10,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:27:10,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,763 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-29 04:27:10,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:27:10,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:27:10,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:27:10,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:27:10,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (1/1) ... [2023-11-29 04:27:10,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:10,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:27:10,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:27:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:27:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:27:10,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:27:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:27:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:27:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:27:10,919 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:27:10,921 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:27:11,060 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:27:11,091 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:27:11,092 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:27:11,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:11 BoogieIcfgContainer [2023-11-29 04:27:11,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:27:11,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:27:11,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:27:11,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:27:11,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:27:10" (1/3) ... [2023-11-29 04:27:11,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:11, skipping insertion in model container [2023-11-29 04:27:11,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:10" (2/3) ... [2023-11-29 04:27:11,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:11, skipping insertion in model container [2023-11-29 04:27:11,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:11" (3/3) ... [2023-11-29 04:27:11,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:11,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:27:11,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:27:11,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:27:11,181 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;@5360b088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:27:11,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:27:11,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:11,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:11,197 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:11,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:11,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2001514219, now seen corresponding path program 1 times [2023-11-29 04:27:11,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065554098] [2023-11-29 04:27:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:27:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:27:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:27:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:27:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:27:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:27:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 04:27:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065554098] [2023-11-29 04:27:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065554098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:11,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:27:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780728732] [2023-11-29 04:27:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:11,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:27:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:11,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:27:11,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:27:11,475 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 04:27:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:11,508 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2023-11-29 04:27:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:27:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-11-29 04:27:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:11,518 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:27:11,518 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 04:27:11,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:27:11,526 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:11,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:27:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 04:27:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 04:27:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 04:27:11,559 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 46 [2023-11-29 04:27:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:11,559 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 04:27:11,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 04:27:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 04:27:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:11,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:11,562 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:11,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:27:11,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:11,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1049244849, now seen corresponding path program 1 times [2023-11-29 04:27:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584820744] [2023-11-29 04:27:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:27:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 04:27:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 04:27:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 04:27:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 04:27:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 04:27:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:27:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 04:27:11,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:27:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584820744] [2023-11-29 04:27:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584820744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:11,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:27:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516684968] [2023-11-29 04:27:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:27:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:27:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:27:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:27:11,793 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 04:27:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:11,813 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-29 04:27:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:27:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2023-11-29 04:27:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:11,815 INFO L225 Difference]: With dead ends: 47 [2023-11-29 04:27:11,815 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 04:27:11,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-29 04:27:11,817 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:11,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:27:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 04:27:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 04:27:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 04:27:11,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 46 [2023-11-29 04:27:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:11,827 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 04:27:11,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 04:27:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 04:27:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:11,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:11,830 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:11,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:27:11,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:11,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1049304431, now seen corresponding path program 1 times [2023-11-29 04:27:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:27:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328254132] [2023-11-29 04:27:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:27:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:27:11,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:27:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:27:11,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:27:11,935 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:27:11,936 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:27:11,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:27:11,941 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 04:27:11,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:27:11,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:27:11 BoogieIcfgContainer [2023-11-29 04:27:11,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:27:11,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:27:11,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:27:11,997 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:27:11,997 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:11" (3/4) ... [2023-11-29 04:27:11,999 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:27:12,000 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:27:12,000 INFO L158 Benchmark]: Toolchain (without parser) took 1557.46ms. Allocated memory is still 199.2MB. Free memory was 161.9MB in the beginning and 165.6MB in the end (delta: -3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:27:12,000 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:27:12,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.21ms. Allocated memory is still 199.2MB. Free memory was 161.9MB in the beginning and 167.0MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.97ms. Allocated memory is still 199.2MB. Free memory was 167.0MB in the beginning and 165.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,002 INFO L158 Benchmark]: Boogie Preprocessor took 34.39ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,002 INFO L158 Benchmark]: RCFGBuilder took 316.56ms. Allocated memory is still 199.2MB. Free memory was 163.4MB in the beginning and 150.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,003 INFO L158 Benchmark]: TraceAbstraction took 900.91ms. Allocated memory is still 199.2MB. Free memory was 150.2MB in the beginning and 166.7MB in the end (delta: -16.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,003 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 165.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:27:12,006 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.18ms. Allocated memory is still 119.5MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.21ms. Allocated memory is still 199.2MB. Free memory was 161.9MB in the beginning and 167.0MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.97ms. Allocated memory is still 199.2MB. Free memory was 167.0MB in the beginning and 165.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.39ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 163.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.56ms. Allocated memory is still 199.2MB. Free memory was 163.4MB in the beginning and 150.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 900.91ms. Allocated memory is still 199.2MB. Free memory was 150.2MB in the beginning and 166.7MB in the end (delta: -16.4MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 199.2MB. Free memory was 166.7MB in the beginning and 165.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.75; [L23] double var_1_5 = 2.05; [L24] double var_1_6 = 9.375; [L25] double var_1_7 = 64.4; [L26] double var_1_8 = 10000.25; [L27] signed short int var_1_9 = -2; [L28] signed short int var_1_10 = 0; [L29] unsigned short int var_1_11 = 4; [L30] unsigned short int var_1_12 = 128; [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L43] var_1_5 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L44] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L45] var_1_6 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L46] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L47] var_1_7 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L48] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L49] var_1_10 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L50] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L52] var_1_12 = __VERIFIER_nondet_ushort() [L53] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L53] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=32766, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=32766, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L67] RET updateVariables() [L68] CALL step() [L34] var_1_8 = var_1_5 [L35] var_1_9 = var_1_10 [L36] var_1_11 = var_1_12 [L37] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=32766, var_1_10=32766, var_1_11=65534, var_1_12=65534, var_1_1=67/4, var_1_5=65539, var_1_8=65539, var_1_9=32766] [L38] COND TRUE stepLocal_0 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9)))) [L39] var_1_1 = ((var_1_5 + var_1_6) + var_1_7) VAL [isInitial=1, stepLocal_0=32766, var_1_10=32766, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=32766] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((((var_1_9 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9))))) ? (var_1_1 == ((double) ((var_1_5 + var_1_6) + var_1_7))) : 1) && (var_1_8 == ((double) var_1_5))) && (var_1_9 == ((signed short int) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_12)) ; [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32766, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=32766] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=32766, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 54 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 168/168 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-29 04:27:12,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya --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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:27:14,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:27:14,110 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:27:14,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:27:14,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:27:14,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:27:14,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:27:14,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:27:14,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:27:14,157 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:27:14,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:27:14,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:27:14,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:27:14,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:27:14,160 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:27:14,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:27:14,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:27:14,162 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:27:14,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:27:14,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:27:14,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:27:14,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:27:14,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:27:14,168 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:27:14,168 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:27:14,169 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:27:14,169 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:27:14,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:27:14,170 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:27:14,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:27:14,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:27:14,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:27:14,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:27:14,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:14,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:27:14,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:27:14,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:27:14,173 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:27:14,173 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:27:14,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:27:14,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:27:14,174 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:27:14,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:27:14,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:27:14,175 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:27:14,175 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2023-11-29 04:27:14,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:27:14,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:27:14,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:27:14,488 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:27:14,488 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:27:14,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:17,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:27:17,636 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:27:17,637 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:17,645 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/5524b55d6/896a6c14bd004180bce66f8c99ebdd32/FLAGebafcb52e [2023-11-29 04:27:17,661 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/data/5524b55d6/896a6c14bd004180bce66f8c99ebdd32 [2023-11-29 04:27:17,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:27:17,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:27:17,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:17,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:27:17,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:27:17,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbe24e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17, skipping insertion in model container [2023-11-29 04:27:17,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:27:17,849 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2023-11-29 04:27:17,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:17,891 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:27:17,902 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_500ccb2a-7ae9-411b-b198-3bbcc47e471a/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2023-11-29 04:27:17,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:17,932 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:27:17,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17 WrapperNode [2023-11-29 04:27:17,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:17,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:17,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:27:17,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:27:17,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,975 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2023-11-29 04:27:17,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:17,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:27:17,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:27:17,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:27:17,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:17,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,002 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-29 04:27:18,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:27:18,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:27:18,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:27:18,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:27:18,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (1/1) ... [2023-11-29 04:27:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:18,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:27:18,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:27:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:27:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:27:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:27:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:27:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:27:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:27:18,167 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:27:18,170 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:27:19,238 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:27:19,275 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:27:19,276 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:27:19,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:19 BoogieIcfgContainer [2023-11-29 04:27:19,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:27:19,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:27:19,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:27:19,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:27:19,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:27:17" (1/3) ... [2023-11-29 04:27:19,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779133ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:19, skipping insertion in model container [2023-11-29 04:27:19,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:17" (2/3) ... [2023-11-29 04:27:19,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779133ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:19, skipping insertion in model container [2023-11-29 04:27:19,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:19" (3/3) ... [2023-11-29 04:27:19,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2023-11-29 04:27:19,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:27:19,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:27:19,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:27:19,360 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;@763a0ead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:27:19,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:27:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:19,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:19,373 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:19,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:19,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2001514219, now seen corresponding path program 1 times [2023-11-29 04:27:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130461750] [2023-11-29 04:27:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:19,389 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-29 04:27:19,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:19,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:19,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:19,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:27:19,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 04:27:19,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:19,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130461750] [2023-11-29 04:27:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130461750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:27:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385554199] [2023-11-29 04:27:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:19,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:27:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:27:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:27:19,746 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 04:27:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:20,487 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2023-11-29 04:27:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:27:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2023-11-29 04:27:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:20,509 INFO L225 Difference]: With dead ends: 49 [2023-11-29 04:27:20,510 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 04:27:20,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:27:20,515 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:20,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:27:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 04:27:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 04:27:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 04:27:20,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 46 [2023-11-29 04:27:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:20,546 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 04:27:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 04:27:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 04:27:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:20,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:20,549 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:20,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:20,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:20,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:20,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1049244849, now seen corresponding path program 1 times [2023-11-29 04:27:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672267679] [2023-11-29 04:27:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:20,752 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-29 04:27:20,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:20,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:20,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:27:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:20,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:27:20,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 04:27:21,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:21,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672267679] [2023-11-29 04:27:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672267679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:21,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:27:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016332787] [2023-11-29 04:27:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:21,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:27:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:27:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:27:21,050 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 04:27:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:22,475 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-29 04:27:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:27:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2023-11-29 04:27:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:22,491 INFO L225 Difference]: With dead ends: 47 [2023-11-29 04:27:22,491 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 04:27:22,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-29 04:27:22,493 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:22,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:27:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 04:27:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 04:27:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:27:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 04:27:22,499 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 46 [2023-11-29 04:27:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:22,500 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 04:27:22,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 04:27:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 04:27:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:27:22,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:22,502 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:22,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:27:22,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:22,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:27:22,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1049304431, now seen corresponding path program 1 times [2023-11-29 04:27:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993244713] [2023-11-29 04:27:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:22,705 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-29 04:27:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:22,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:27:22,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:27:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:22,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 04:27:22,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:24,142 WARN L293 SmtUtils]: Spent 18.42s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:28:34,436 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:28:54,242 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:05,610 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:18,333 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:23,919 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:31,992 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:40,062 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:48,146 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:05,416 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:13,492 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:21,360 WARN L293 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:35,558 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:43,622 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:51,700 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:56,371 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((~var_1_8~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0))) (and (fp.leq ~var_1_8~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (exists ((~var_1_6~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (and (fp.geq ~var_1_6~0 .cse1) (exists ((~var_1_7~0 (_ FloatingPoint 11 53))) (and (not (let ((.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse2 .cse2))) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0))) (fp.geq ~var_1_7~0 .cse1))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))))) (fp.geq ~var_1_8~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from true [2023-11-29 04:31:11,388 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:16,409 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:24,475 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:32,555 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:41,513 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:45,529 WARN L854 $PredicateComparison]: unable to prove that (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (and (fp.geq ~var_1_6~0 .cse0) (not (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse1 .cse1))) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0))) (fp.geq ~var_1_7~0 .cse0) (fp.geq ~var_1_8~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0))))))) is different from false [2023-11-29 04:31:49,546 WARN L876 $PredicateComparison]: unable to prove that (exists ((~var_1_7~0 (_ FloatingPoint 11 53)) (~var_1_6~0 (_ FloatingPoint 11 53)) (~var_1_8~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (and (fp.geq ~var_1_6~0 .cse0) (not (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ~var_1_8~0 ~var_1_6~0) ~var_1_7~0))) (fp.eq .cse1 .cse1))) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0))) (fp.geq ~var_1_7~0 .cse0) (fp.geq ~var_1_8~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 2305843009213691390.0))))))) is different from true [2023-11-29 04:31:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 04:31:49,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:25,075 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:34:13,155 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (and (forall ((~var_1_7~0 (_ FloatingPoint 11 53))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ~var_1_7~0))) (fp.eq .cse0 .cse0)) (not (fp.leq ~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (not (fp.geq ~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3))))) (forall ((~var_1_7~0 (_ FloatingPoint 11 53))) (or (let ((.cse4 (fp.add c_currentRoundingMode .cse1 ~var_1_7~0))) (fp.eq .cse4 .cse4)) (not (fp.leq ~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3)))) (not (fp.geq ~var_1_7~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))))) is different from true [2023-11-29 04:34:13,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:34:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993244713] [2023-11-29 04:34:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993244713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:34:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1535399456] [2023-11-29 04:34:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:34:13,157 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:34:13,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:34:13,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:34:13,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-29 04:34:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:34:13,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:34:13,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:35:00,279 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:05,733 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:10,871 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:39,778 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:06,099 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:15,127 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:30,487 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:38,557 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:46,629 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:59,405 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:07,498 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:20,372 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:33,036 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:38,085 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:46,151 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:51,217 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:37:59,283 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:38:07,351 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:38:24,307 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:38:51,850 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:38:59,855 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:39:12,371 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:39:25,354 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:40:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 04:40:01,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:40:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1535399456] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:39,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:40:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2023-11-29 04:40:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374174109] [2023-11-29 04:40:39,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:40:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:40:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:40:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=260, Unknown=17, NotChecked=108, Total=462 [2023-11-29 04:40:39,884 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 04:41:12,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:41:13,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:41:15,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:41:48,573 WARN L293 SmtUtils]: Spent 18.25s on a formula simplification. DAG size of input: 85 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:41:49,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:41:51,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:41:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:52,185 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-11-29 04:41:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 04:41:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-11-29 04:41:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:52,205 INFO L225 Difference]: With dead ends: 39 [2023-11-29 04:41:52,205 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:41:52,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 229.5s TimeCoverageRelationStatistics Valid=149, Invalid=490, Unknown=23, NotChecked=150, Total=812 [2023-11-29 04:41:52,207 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:52,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 79 Unchecked, 8.9s Time] [2023-11-29 04:41:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:41:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:41:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:41:52,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2023-11-29 04:41:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:52,209 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:41:52,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 04:41:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:41:52,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:41:52,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:41:52,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-11-29 04:41:52,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:41:52,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:41:52,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:41:55,642 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:41:55,643 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:41:55,643 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 04:41:55,643 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:41:55,643 INFO L899 garLoopResultBuilder]: For program point L48-1(line 48) no Hoare annotation was computed. [2023-11-29 04:41:55,643 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-11-29 04:41:55,643 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2023-11-29 04:41:55,644 INFO L895 garLoopResultBuilder]: At program point L65-2(lines 65 71) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_7~0 .cse0))))))) [2023-11-29 04:41:55,644 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 71) no Hoare annotation was computed. [2023-11-29 04:41:55,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:41:55,644 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_7~0 .cse0))))))) [2023-11-29 04:41:55,644 INFO L895 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_7~0 .cse0))))))) [2023-11-29 04:41:55,644 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-11-29 04:41:55,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:41:55,645 INFO L899 garLoopResultBuilder]: For program point L54(lines 42 55) no Hoare annotation was computed. [2023-11-29 04:41:55,645 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_7~0 .cse0))))))) [2023-11-29 04:41:55,645 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.geq ~var_1_5~0 .cse0) (fp.leq ~var_1_5~0 .cse1)) (and (fp.leq ~var_1_5~0 .cse2) (fp.geq ~var_1_5~0 .cse3))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse0)) (and (fp.leq ~var_1_6~0 .cse2) (fp.geq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_7~0 .cse0))))))) [2023-11-29 04:41:55,645 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 04:41:55,645 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-11-29 04:41:55,645 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:41:55,645 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-11-29 04:41:55,645 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-29 04:41:55,646 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:41:55,646 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:41:55,646 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:41:55,646 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:41:55,648 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 04:41:55,649 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:41:55,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 04:41:55,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:41:55 BoogieIcfgContainer [2023-11-29 04:41:55,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:41:55,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:41:55,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:41:55,663 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:41:55,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:19" (3/4) ... [2023-11-29 04:41:55,666 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:41:55,669 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:41:55,674 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-29 04:41:55,674 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 04:41:55,675 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:41:55,675 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:41:55,762 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:41:55,763 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:41:55,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:41:55,764 INFO L158 Benchmark]: Toolchain (without parser) took 878098.50ms. Allocated memory was 65.0MB in the beginning and 113.2MB in the end (delta: 48.2MB). Free memory was 35.9MB in the beginning and 62.2MB in the end (delta: -26.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,764 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:41:55,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.98ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 35.8MB in the beginning and 66.9MB in the end (delta: -31.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.56ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,765 INFO L158 Benchmark]: Boogie Preprocessor took 46.94ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 62.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,766 INFO L158 Benchmark]: RCFGBuilder took 1252.26ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 49.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,766 INFO L158 Benchmark]: TraceAbstraction took 876382.30ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 48.3MB in the beginning and 67.5MB in the end (delta: -19.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,767 INFO L158 Benchmark]: Witness Printer took 100.36ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 62.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:41:55,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.98ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 35.8MB in the beginning and 66.9MB in the end (delta: -31.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.56ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.94ms. Allocated memory is still 90.2MB. Free memory was 65.0MB in the beginning and 62.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1252.26ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 49.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 876382.30ms. Allocated memory was 90.2MB in the beginning and 113.2MB in the end (delta: 23.1MB). Free memory was 48.3MB in the beginning and 67.5MB in the end (delta: -19.2MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 100.36ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 62.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.3s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 74.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 79 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 74 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 229.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 38 NumberOfFragments, 626 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 795 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 796.4s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 180 ConstructedInterpolants, 2 QuantifiedInterpolants, 6809 SizeOfPredicates, 37 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 264/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 04:41:55,980 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 04:41:56,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_500ccb2a-7ae9-411b-b198-3bbcc47e471a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE