./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:53:24,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:53:24,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:53:24,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:53:24,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:53:24,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:53:24,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:53:24,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:53:24,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:53:24,091 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:53:24,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:53:24,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:53:24,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:53:24,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:53:24,093 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:53:24,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:53:24,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:53:24,095 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:53:24,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:53:24,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:53:24,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:53:24,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:53:24,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:53:24,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:53:24,099 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:53:24,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:53:24,100 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:53:24,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:53:24,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:53:24,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:53:24,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:53:24,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:53:24,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:53:24,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:53:24,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:53:24,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:53:24,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:53:24,105 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_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2023-11-29 01:53:24,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:53:24,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:53:24,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:53:24,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:53:24,319 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:53:24,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:27,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:53:27,267 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:53:27,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:27,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/8d779aa32/b73f8f01b1bb445f95be991174595828/FLAG13db5c3f7 [2023-11-29 01:53:27,287 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/8d779aa32/b73f8f01b1bb445f95be991174595828 [2023-11-29 01:53:27,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:53:27,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:53:27,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:53:27,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:53:27,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:53:27,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767dcc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27, skipping insertion in model container [2023-11-29 01:53:27,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:53:27,443 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_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i[915,928] [2023-11-29 01:53:27,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:53:27,494 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:53:27,508 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_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i[915,928] [2023-11-29 01:53:27,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:53:27,539 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:53:27,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27 WrapperNode [2023-11-29 01:53:27,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:53:27,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:53:27,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:53:27,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:53:27,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,577 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-11-29 01:53:27,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:53:27,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:53:27,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:53:27,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:53:27,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,605 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 01:53:27,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:53:27,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:53:27,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:53:27,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:53:27,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (1/1) ... [2023-11-29 01:53:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:53:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:27,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:53:27,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:53:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:53:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:53:27,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:53:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:53:27,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:53:27,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:53:27,755 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:53:27,757 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:53:27,938 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:53:27,979 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:53:27,979 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:53:27,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:27 BoogieIcfgContainer [2023-11-29 01:53:27,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:53:27,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:53:27,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:53:27,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:53:27,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:53:27" (1/3) ... [2023-11-29 01:53:27,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e215d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:53:27, skipping insertion in model container [2023-11-29 01:53:27,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:27" (2/3) ... [2023-11-29 01:53:27,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e215d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:53:27, skipping insertion in model container [2023-11-29 01:53:27,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:27" (3/3) ... [2023-11-29 01:53:27,991 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:28,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:53:28,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:53:28,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:53:28,061 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;@1ca22c03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:53:28,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:53:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:53:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:53:28,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:28,075 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:28,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:28,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1291186250, now seen corresponding path program 1 times [2023-11-29 01:53:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945394211] [2023-11-29 01:53:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:53:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:53:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:53:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:53:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:53:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:53:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:53:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:53:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:53:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 01:53:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:53:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945394211] [2023-11-29 01:53:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945394211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:53:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642531229] [2023-11-29 01:53:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:53:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:53:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:53:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:53:28,441 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:28,475 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2023-11-29 01:53:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:53:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-29 01:53:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:28,485 INFO L225 Difference]: With dead ends: 65 [2023-11-29 01:53:28,486 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 01:53:28,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:53:28,492 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:28,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:53:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 01:53:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 01:53:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:53:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-29 01:53:28,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-29 01:53:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:28,532 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-29 01:53:28,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-29 01:53:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:53:28,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:28,536 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:28,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:53:28,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:28,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1150844428, now seen corresponding path program 1 times [2023-11-29 01:53:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832932715] [2023-11-29 01:53:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:53:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:53:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:53:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:53:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:53:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:53:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:53:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:53:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:53:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 01:53:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:53:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832932715] [2023-11-29 01:53:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832932715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:53:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061886973] [2023-11-29 01:53:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:28,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:53:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:53:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:53:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:53:28,831 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:28,951 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-29 01:53:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:53:28,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-29 01:53:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:28,954 INFO L225 Difference]: With dead ends: 94 [2023-11-29 01:53:28,954 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 01:53:28,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:53:28,957 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:28,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:53:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 01:53:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-29 01:53:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:53:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-29 01:53:28,973 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-29 01:53:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:28,974 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-29 01:53:28,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-29 01:53:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:53:28,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:28,976 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:28,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:53:28,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:28,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2041482526, now seen corresponding path program 1 times [2023-11-29 01:53:28,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:53:28,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979243760] [2023-11-29 01:53:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:53:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:53:29,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:53:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:53:29,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:53:29,073 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:53:29,074 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:53:29,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:53:29,079 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 01:53:29,083 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:53:29,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:53:29 BoogieIcfgContainer [2023-11-29 01:53:29,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:53:29,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:53:29,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:53:29,129 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:53:29,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:27" (3/4) ... [2023-11-29 01:53:29,131 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:53:29,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:53:29,133 INFO L158 Benchmark]: Toolchain (without parser) took 1841.95ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 101.2MB in the end (delta: 44.8MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,133 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:53:29,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.43ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 134.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,135 INFO L158 Benchmark]: Boogie Preprocessor took 41.57ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,135 INFO L158 Benchmark]: RCFGBuilder took 359.87ms. Allocated memory is still 184.5MB. Free memory was 129.8MB in the beginning and 115.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,136 INFO L158 Benchmark]: TraceAbstraction took 1144.88ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 101.2MB in the end (delta: 12.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-11-29 01:53:29,136 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 184.5MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:53:29,139 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.17ms. Allocated memory is still 100.7MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.43ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 134.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 132.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.57ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.87ms. Allocated memory is still 184.5MB. Free memory was 129.8MB in the beginning and 115.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1144.88ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 101.2MB in the end (delta: 12.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 184.5MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 [L90] RET updateLastVariables() [L91] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-1, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_8=-1, var_1_9=2] [L91] RET updateVariables() [L92] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 81 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 01:53:29,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:53:31,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:53:31,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:53:31,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:53:31,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:53:31,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:53:31,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:53:31,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:53:31,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:53:31,214 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:53:31,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:53:31,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:53:31,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:53:31,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:53:31,217 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:53:31,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:53:31,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:53:31,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:53:31,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:53:31,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:53:31,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:53:31,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:53:31,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:53:31,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:53:31,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:53:31,222 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:53:31,222 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:53:31,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:53:31,223 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:53:31,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:53:31,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:53:31,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:53:31,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:53:31,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:53:31,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:53:31,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:53:31,226 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:53:31,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:53:31,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:53:31,226 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:53:31,226 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_769bf015-c195-4252-aead-3b1422c5eac8/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_769bf015-c195-4252-aead-3b1422c5eac8/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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2023-11-29 01:53:31,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:53:31,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:53:31,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:53:31,541 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:53:31,542 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:53:31,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:34,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:53:34,496 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:53:34,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:34,505 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/5c9eb2887/a621f4a595494749a11641bd3cf70ee2/FLAG0c31f02f6 [2023-11-29 01:53:34,517 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/data/5c9eb2887/a621f4a595494749a11641bd3cf70ee2 [2023-11-29 01:53:34,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:53:34,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:53:34,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:53:34,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:53:34,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:53:34,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7ead34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34, skipping insertion in model container [2023-11-29 01:53:34,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:53:34,719 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_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i[915,928] [2023-11-29 01:53:34,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:53:34,769 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:53:34,782 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_769bf015-c195-4252-aead-3b1422c5eac8/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i[915,928] [2023-11-29 01:53:34,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:53:34,816 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:53:34,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34 WrapperNode [2023-11-29 01:53:34,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:53:34,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:53:34,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:53:34,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:53:34,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,857 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-11-29 01:53:34,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:53:34,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:53:34,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:53:34,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:53:34,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,886 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 01:53:34,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:53:34,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:53:34,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:53:34,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:53:34,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (1/1) ... [2023-11-29 01:53:34,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:53:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:53:34,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:53:34,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:53:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:53:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:53:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:53:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:53:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:53:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:53:35,059 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:53:35,061 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:53:35,253 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:53:35,309 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:53:35,310 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:53:35,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:35 BoogieIcfgContainer [2023-11-29 01:53:35,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:53:35,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:53:35,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:53:35,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:53:35,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:53:34" (1/3) ... [2023-11-29 01:53:35,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f932b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:53:35, skipping insertion in model container [2023-11-29 01:53:35,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:53:34" (2/3) ... [2023-11-29 01:53:35,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f932b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:53:35, skipping insertion in model container [2023-11-29 01:53:35,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:35" (3/3) ... [2023-11-29 01:53:35,319 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2023-11-29 01:53:35,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:53:35,334 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:53:35,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:53:35,382 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;@531e45ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:53:35,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:53:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:53:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:53:35,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:35,395 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:35,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:35,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1291186250, now seen corresponding path program 1 times [2023-11-29 01:53:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314901703] [2023-11-29 01:53:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:35,413 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 01:53:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:35,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:35,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:35,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:53:35,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-29 01:53:35,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:35,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314901703] [2023-11-29 01:53:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314901703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:53:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060753133] [2023-11-29 01:53:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:53:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:35,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:53:35,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:53:35,610 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:35,641 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2023-11-29 01:53:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:53:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-11-29 01:53:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:35,649 INFO L225 Difference]: With dead ends: 65 [2023-11-29 01:53:35,649 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 01:53:35,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:53:35,654 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:35,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:53:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 01:53:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 01:53:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:53:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-11-29 01:53:35,688 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 58 [2023-11-29 01:53:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:35,688 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-11-29 01:53:35,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-11-29 01:53:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:53:35,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:35,691 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:35,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:35,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:35,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:35,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:35,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1150844428, now seen corresponding path program 1 times [2023-11-29 01:53:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819439999] [2023-11-29 01:53:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:35,894 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 01:53:35,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:35,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:35,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:36,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:53:36,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 01:53:36,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:36,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819439999] [2023-11-29 01:53:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819439999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:53:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584474968] [2023-11-29 01:53:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:36,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:53:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:36,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:53:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:53:36,164 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:36,349 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-29 01:53:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:53:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-11-29 01:53:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:36,352 INFO L225 Difference]: With dead ends: 94 [2023-11-29 01:53:36,353 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 01:53:36,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:53:36,355 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:36,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:53:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 01:53:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-29 01:53:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 01:53:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2023-11-29 01:53:36,372 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 58 [2023-11-29 01:53:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:36,372 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2023-11-29 01:53:36,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2023-11-29 01:53:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:53:36,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:36,375 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:36,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:36,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:36,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:36,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2041482526, now seen corresponding path program 1 times [2023-11-29 01:53:36,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:36,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369003253] [2023-11-29 01:53:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:36,581 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 01:53:36,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:36,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:36,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:36,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:53:36,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 01:53:45,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:45,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369003253] [2023-11-29 01:53:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369003253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:45,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 01:53:45,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306287742] [2023-11-29 01:53:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:45,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:53:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:45,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:53:45,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:53:45,258 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:46,416 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2023-11-29 01:53:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:53:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-11-29 01:53:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:46,419 INFO L225 Difference]: With dead ends: 125 [2023-11-29 01:53:46,419 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 01:53:46,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-11-29 01:53:46,421 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:46,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 154 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:53:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 01:53:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-11-29 01:53:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:53:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-11-29 01:53:46,436 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 59 [2023-11-29 01:53:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:46,436 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-11-29 01:53:46,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 01:53:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-11-29 01:53:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 01:53:46,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:53:46,439 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:53:46,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:46,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:46,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:53:46,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:53:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1357674845, now seen corresponding path program 1 times [2023-11-29 01:53:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:53:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801121586] [2023-11-29 01:53:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:53:46,643 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 01:53:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:53:46,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:46,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 (5)] Waiting until timeout for monitored process [2023-11-29 01:53:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:46,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:53:46,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-29 01:53:46,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:53:46,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:53:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801121586] [2023-11-29 01:53:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801121586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:53:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:53:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:53:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744771261] [2023-11-29 01:53:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:53:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:53:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:53:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:53:46,804 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:53:46,926 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2023-11-29 01:53:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:53:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-29 01:53:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:53:46,929 INFO L225 Difference]: With dead ends: 123 [2023-11-29 01:53:46,929 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:53:46,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:53:46,931 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:53:46,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:53:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:53:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:53:46,932 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 01:53:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:53:46,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2023-11-29 01:53:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:53:46,933 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:53:46,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 01:53:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:53:46,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:53:46,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:53:46,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 (5)] Forceful destruction successful, exit code 0 [2023-11-29 01:53:47,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 01:53:47,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:53:48,006 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-29 01:53:48,007 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-29 01:53:48,007 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-29 01:53:48,007 INFO L895 garLoopResultBuilder]: At program point L89-2(lines 89 95) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-29 01:53:48,007 INFO L899 garLoopResultBuilder]: For program point L89-3(lines 89 95) no Hoare annotation was computed. [2023-11-29 01:53:48,008 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 01:53:48,008 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 01:53:48,008 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 01:53:48,008 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:53:48,008 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:53:48,008 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 50) no Hoare annotation was computed. [2023-11-29 01:53:48,008 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-29 01:53:48,009 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-11-29 01:53:48,009 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 01:53:48,009 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 01:53:48,009 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 47) no Hoare annotation was computed. [2023-11-29 01:53:48,009 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:53:48,009 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:53:48,010 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 01:53:48,010 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-29 01:53:48,010 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 01:53:48,010 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 01:53:48,010 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-29 01:53:48,010 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-29 01:53:48,011 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 62 77) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 53) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 53) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 61) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 01:53:48,011 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 01:53:48,012 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 01:53:48,015 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 01:53:48,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:53:48,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 01:53:48,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:53:48 BoogieIcfgContainer [2023-11-29 01:53:48,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:53:48,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:53:48,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:53:48,033 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:53:48,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:53:35" (3/4) ... [2023-11-29 01:53:48,035 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 01:53:48,039 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 01:53:48,043 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 01:53:48,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 01:53:48,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 01:53:48,044 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 01:53:48,192 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:53:48,193 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 01:53:48,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:53:48,194 INFO L158 Benchmark]: Toolchain (without parser) took 13673.02ms. Allocated memory was 67.1MB in the beginning and 406.8MB in the end (delta: 339.7MB). Free memory was 33.6MB in the beginning and 378.2MB in the end (delta: -344.6MB). Peak memory consumption was 180.7MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,194 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 67.1MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:53:48,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.31ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 39.1MB in the end (delta: -5.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.45ms. Allocated memory is still 67.1MB. Free memory was 38.9MB in the beginning and 37.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,195 INFO L158 Benchmark]: Boogie Preprocessor took 47.81ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 34.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,196 INFO L158 Benchmark]: RCFGBuilder took 403.87ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 34.6MB in the beginning and 62.3MB in the end (delta: -27.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,196 INFO L158 Benchmark]: TraceAbstraction took 12719.29ms. Allocated memory was 96.5MB in the beginning and 337.6MB in the end (delta: 241.2MB). Free memory was 61.5MB in the beginning and 125.0MB in the end (delta: -63.5MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,197 INFO L158 Benchmark]: Witness Printer took 160.52ms. Allocated memory was 337.6MB in the beginning and 406.8MB in the end (delta: 69.2MB). Free memory was 125.0MB in the beginning and 378.2MB in the end (delta: -253.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:53:48,199 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.23ms. Allocated memory is still 67.1MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.31ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 39.1MB in the end (delta: -5.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.45ms. Allocated memory is still 67.1MB. Free memory was 38.9MB in the beginning and 37.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.81ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 34.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.87ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 34.6MB in the beginning and 62.3MB in the end (delta: -27.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12719.29ms. Allocated memory was 96.5MB in the beginning and 337.6MB in the end (delta: 241.2MB). Free memory was 61.5MB in the beginning and 125.0MB in the end (delta: -63.5MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. * Witness Printer took 160.52ms. Allocated memory was 337.6MB in the beginning and 406.8MB in the end (delta: 69.2MB). Free memory was 125.0MB in the beginning and 378.2MB in the end (delta: -253.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 145 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 68 PreInvPairs, 88 NumberOfFragments, 679 HoareAnnotationTreeSize, 68 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 904 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 21 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: (((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2023-11-29 01:53:48,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_769bf015-c195-4252-aead-3b1422c5eac8/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 Writing output log to file Ultimate.log Result: TRUE