./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 14:03:24,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:03:24,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:03:24,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:03:24,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:03:24,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:03:24,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:03:24,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:03:24,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:03:24,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:03:24,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:03:24,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:03:24,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:03:24,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:03:24,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:03:24,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:03:24,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:03:24,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:03:24,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:03:24,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:03:24,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:03:24,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:03:24,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:03:24,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:03:24,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:03:24,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:03:24,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:03:24,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:03:24,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:03:24,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:03:24,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:03:24,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:03:24,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:03:24,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:03:24,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:03:24,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:03:24,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:03:24,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:03:24,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:03:24,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:03:24,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:03:24,430 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 14:03:24,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:03:24,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:03:24,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:03:24,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:03:24,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:03:24,456 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:03:24,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:03:24,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:03:24,458 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:03:24,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:03:24,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 14:03:24,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:03:24,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 14:03:24,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:03:24,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 14:03:24,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 14:03:24,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:03:24,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 14:03:24,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:03:24,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:03:24,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:03:24,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:03:24,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:03:24,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:03:24,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 14:03:24,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 14:03:24,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 14:03:24,463 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 14:03:24,463 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 14:03:24,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 14:03:24,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-11-21 14:03:24,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:03:24,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:03:24,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:03:24,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:03:24,773 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:03:24,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-21 14:03:28,054 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:03:28,254 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:03:28,255 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-21 14:03:28,261 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/71e917fe3/0e0dbd6d2679401d96279a259a2943ef/FLAGab0295515 [2022-11-21 14:03:28,275 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/71e917fe3/0e0dbd6d2679401d96279a259a2943ef [2022-11-21 14:03:28,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:03:28,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:03:28,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:03:28,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:03:28,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:03:28,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0a8b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28, skipping insertion in model container [2022-11-21 14:03:28,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:03:28,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:03:28,456 WARN L237 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_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-21 14:03:28,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:03:28,498 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:03:28,510 WARN L237 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_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-21 14:03:28,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:03:28,538 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:03:28,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28 WrapperNode [2022-11-21 14:03:28,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:03:28,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:03:28,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:03:28,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:03:28,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,573 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-11-21 14:03:28,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:03:28,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:03:28,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:03:28,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:03:28,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:03:28,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:03:28,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:03:28,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:03:28,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (1/1) ... [2022-11-21 14:03:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:03:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:03:28,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:03:28,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:03:28,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:03:28,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:03:28,794 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:03:28,797 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:03:28,963 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:03:28,970 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:03:28,971 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 14:03:28,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:28 BoogieIcfgContainer [2022-11-21 14:03:28,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:03:28,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:03:28,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:03:28,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:03:28,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:03:28" (1/3) ... [2022-11-21 14:03:28,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186981ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:03:28, skipping insertion in model container [2022-11-21 14:03:28,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:28" (2/3) ... [2022-11-21 14:03:28,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186981ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:03:28, skipping insertion in model container [2022-11-21 14:03:28,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:28" (3/3) ... [2022-11-21 14:03:28,999 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-11-21 14:03:29,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:03:29,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 14:03:29,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:03:29,160 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=LoopsAndPotentialCycles, 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;@4cac3137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:03:29,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 14:03:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-21 14:03:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 14:03:29,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:03:29,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 14:03:29,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:03:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:03:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-21 14:03:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:03:29,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093594949] [2022-11-21 14:03:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:03:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:03:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:03:29,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:03:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:03:29,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 14:03:29,433 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:03:29,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 14:03:29,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 14:03:29,443 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-21 14:03:29,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 14:03:29,465 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:03:29,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:03:29 BoogieIcfgContainer [2022-11-21 14:03:29,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 14:03:29,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 14:03:29,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 14:03:29,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 14:03:29,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:28" (3/4) ... [2022-11-21 14:03:29,479 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 14:03:29,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 14:03:29,481 INFO L158 Benchmark]: Toolchain (without parser) took 1201.32ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 96.6MB in the beginning and 139.2MB in the end (delta: -42.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2022-11-21 14:03:29,481 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 136.3MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:03:29,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.86ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 86.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:03:29,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.48ms. Allocated memory is still 136.3MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:03:29,484 INFO L158 Benchmark]: Boogie Preprocessor took 23.15ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 14:03:29,485 INFO L158 Benchmark]: RCFGBuilder took 374.36ms. Allocated memory is still 136.3MB. Free memory was 83.0MB in the beginning and 72.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:03:29,485 INFO L158 Benchmark]: TraceAbstraction took 480.86ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 71.4MB in the beginning and 139.2MB in the end (delta: -67.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:03:29,486 INFO L158 Benchmark]: Witness Printer took 6.17ms. Allocated memory is still 180.4MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:03:29,490 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 136.3MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.86ms. Allocated memory is still 136.3MB. Free memory was 96.6MB in the beginning and 86.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.48ms. Allocated memory is still 136.3MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.15ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 83.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.36ms. Allocated memory is still 136.3MB. Free memory was 83.0MB in the beginning and 72.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 480.86ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 71.4MB in the beginning and 139.2MB in the end (delta: -67.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.17ms. Allocated memory is still 180.4MB. Free memory is still 139.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: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 53, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 14:03:29,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 14:03:32,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 14:03:32,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 14:03:32,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 14:03:32,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 14:03:32,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 14:03:32,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 14:03:32,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 14:03:32,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 14:03:32,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 14:03:32,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 14:03:32,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 14:03:32,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 14:03:32,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 14:03:32,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 14:03:32,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 14:03:32,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 14:03:32,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 14:03:32,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 14:03:32,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 14:03:32,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 14:03:32,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 14:03:32,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 14:03:32,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 14:03:32,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 14:03:32,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 14:03:32,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 14:03:32,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 14:03:32,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 14:03:32,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 14:03:32,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 14:03:32,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 14:03:32,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 14:03:32,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 14:03:32,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 14:03:32,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 14:03:32,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 14:03:32,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 14:03:32,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 14:03:32,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 14:03:32,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 14:03:32,453 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-21 14:03:32,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 14:03:32,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 14:03:32,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 14:03:32,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 14:03:32,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 14:03:32,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 14:03:32,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 14:03:32,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 14:03:32,503 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 14:03:32,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 14:03:32,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 14:03:32,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 14:03:32,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 14:03:32,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 14:03:32,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 14:03:32,506 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 14:03:32,506 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 14:03:32,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 14:03:32,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 14:03:32,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 14:03:32,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 14:03:32,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 14:03:32,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 14:03:32,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:03:32,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 14:03:32,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 14:03:32,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 14:03:32,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 14:03:32,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 14:03:32,509 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 14:03:32,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 14:03:32,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 14:03:32,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 14:03:32,511 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55ae7de02214639b88d4da3eeb9e04383c1cc79eda3403226c023fe809370fb9 [2022-11-21 14:03:32,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 14:03:32,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 14:03:32,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 14:03:32,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 14:03:32,990 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 14:03:32,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-21 14:03:36,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 14:03:36,632 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 14:03:36,632 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2022-11-21 14:03:36,641 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/c769556bb/fdaa7e053a8e44b58630eb66f747eebf/FLAGf2942f60c [2022-11-21 14:03:36,658 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/data/c769556bb/fdaa7e053a8e44b58630eb66f747eebf [2022-11-21 14:03:36,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 14:03:36,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 14:03:36,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 14:03:36,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 14:03:36,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 14:03:36,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:36,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9f1a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36, skipping insertion in model container [2022-11-21 14:03:36,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:36,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 14:03:36,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 14:03:36,833 WARN L237 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_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-21 14:03:36,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:03:36,913 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 14:03:36,928 WARN L237 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_cb3d4411-4539-472d-b66f-3bdc0c114105/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.counter_v.c[1107,1120] [2022-11-21 14:03:36,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 14:03:36,980 INFO L208 MainTranslator]: Completed translation [2022-11-21 14:03:36,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36 WrapperNode [2022-11-21 14:03:36,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 14:03:36,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 14:03:36,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 14:03:36,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 14:03:36,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,032 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-11-21 14:03:37,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 14:03:37,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 14:03:37,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 14:03:37,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 14:03:37,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 14:03:37,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 14:03:37,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 14:03:37,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 14:03:37,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (1/1) ... [2022-11-21 14:03:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 14:03:37,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:03:37,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 14:03:37,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 14:03:37,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 14:03:37,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 14:03:37,281 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 14:03:37,284 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 14:03:37,513 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 14:03:37,521 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 14:03:37,542 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 14:03:37,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:37 BoogieIcfgContainer [2022-11-21 14:03:37,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 14:03:37,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 14:03:37,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 14:03:37,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 14:03:37,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:03:36" (1/3) ... [2022-11-21 14:03:37,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f87f5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:03:37, skipping insertion in model container [2022-11-21 14:03:37,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:03:36" (2/3) ... [2022-11-21 14:03:37,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f87f5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:03:37, skipping insertion in model container [2022-11-21 14:03:37,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:37" (3/3) ... [2022-11-21 14:03:37,578 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2022-11-21 14:03:37,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 14:03:37,612 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 14:03:37,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:03:37,686 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=LoopsAndPotentialCycles, 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;@3c45c70f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:03:37,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 14:03:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-21 14:03:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 14:03:37,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:03:37,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 14:03:37,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:03:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:03:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-21 14:03:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:03:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780796847] [2022-11-21 14:03:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:03:37,723 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 [2022-11-21 14:03:37,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:03:37,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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) [2022-11-21 14:03:37,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:03:37,798 WARN L261 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 14:03:37,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:03:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:03:38,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:03:38,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:03:38,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780796847] [2022-11-21 14:03:38,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780796847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:03:38,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:03:38,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:03:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102624811] [2022-11-21 14:03:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:03:38,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 14:03:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:03:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 14:03:38,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 14:03:38,193 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-11-21 14:03:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:03:38,266 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-11-21 14:03:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:03:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 14:03:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:03:38,279 INFO L225 Difference]: With dead ends: 20 [2022-11-21 14:03:38,279 INFO L226 Difference]: Without dead ends: 11 [2022-11-21 14:03:38,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:03:38,287 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:03:38,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:03:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-21 14:03:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-11-21 14:03:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2022-11-21 14:03:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-21 14:03:38,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-21 14:03:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:03:38,331 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-21 14:03:38,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-11-21 14:03:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-21 14:03:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 14:03:38,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:03:38,332 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-21 14:03:38,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:38,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:38,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:03:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:03:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-11-21 14:03:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:03:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568132784] [2022-11-21 14:03:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:03:38,536 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 [2022-11-21 14:03:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:03:38,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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) [2022-11-21 14:03:38,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:03:38,659 WARN L261 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 14:03:38,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:03:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:03:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:03:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:03:40,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:03:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568132784] [2022-11-21 14:03:40,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568132784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:03:40,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:03:40,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-21 14:03:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377497021] [2022-11-21 14:03:40,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:03:40,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 14:03:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:03:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 14:03:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:03:40,041 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:03:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:03:40,325 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-21 14:03:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 14:03:40,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-21 14:03:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:03:40,326 INFO L225 Difference]: With dead ends: 19 [2022-11-21 14:03:40,327 INFO L226 Difference]: Without dead ends: 17 [2022-11-21 14:03:40,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:03:40,328 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:03:40,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:03:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-21 14:03:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-21 14:03:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:03:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-21 14:03:40,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-21 14:03:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:03:40,337 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-21 14:03:40,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:03:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-21 14:03:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 14:03:40,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:03:40,338 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-11-21 14:03:40,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 14:03:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:40,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:03:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:03:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2022-11-21 14:03:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:03:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647356973] [2022-11-21 14:03:40,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:03:40,542 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 [2022-11-21 14:03:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:03:40,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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) [2022-11-21 14:03:40,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:03:40,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:03:40,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:03:40,655 WARN L261 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-21 14:03:40,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:03:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:03:41,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:03:51,635 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 161 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:20,194 WARN L233 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 306 DAG size of output: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:05:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:05:20,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:05:20,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647356973] [2022-11-21 14:05:20,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647356973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:05:20,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:05:20,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-21 14:05:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693294217] [2022-11-21 14:05:20,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:05:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 14:05:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:05:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 14:05:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=228, Unknown=1, NotChecked=0, Total=342 [2022-11-21 14:05:20,629 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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) [2022-11-21 14:05:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:05:22,805 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-21 14:05:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 14:05:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 14:05:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:05:22,806 INFO L225 Difference]: With dead ends: 31 [2022-11-21 14:05:22,807 INFO L226 Difference]: Without dead ends: 29 [2022-11-21 14:05:22,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 98.4s TimeCoverageRelationStatistics Valid=223, Invalid=426, Unknown=1, NotChecked=0, Total=650 [2022-11-21 14:05:22,809 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 66 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:05:22,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 28 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 14:05:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-21 14:05:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-21 14:05:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:05:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-21 14:05:22,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-11-21 14:05:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:05:22,823 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-21 14:05:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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) [2022-11-21 14:05:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-21 14:05:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 14:05:22,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:05:22,825 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2022-11-21 14:05:22,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 14:05:23,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:05:23,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:05:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:05:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 3 times [2022-11-21 14:05:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:05:23,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237384827] [2022-11-21 14:05:23,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:05:23,042 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 [2022-11-21 14:05:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:05:23,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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) [2022-11-21 14:05:23,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:05:23,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 14:05:23,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:05:23,220 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 188 conjunts are in the unsatisfiable core [2022-11-21 14:05:23,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:05:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:05:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:05:45,015 WARN L233 SmtUtils]: Spent 16.20s on a formula simplification. DAG size of input: 161 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:06:34,973 WARN L233 SmtUtils]: Spent 47.31s on a formula simplification. DAG size of input: 313 DAG size of output: 213 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:07:54,609 WARN L233 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 492 DAG size of output: 292 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:09:08,467 WARN L233 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 728 DAG size of output: 379 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:09:55,508 WARN L233 SmtUtils]: Spent 36.90s on a formula simplification. DAG size of input: 985 DAG size of output: 502 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:13:14,622 WARN L233 SmtUtils]: Spent 2.99m on a formula simplification. DAG size of input: 1359 DAG size of output: 622 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:13:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:13:15,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:13:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237384827] [2022-11-21 14:13:15,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237384827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:13:15,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:13:15,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2022-11-21 14:13:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177727132] [2022-11-21 14:13:15,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:13:15,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-21 14:13:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:13:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-21 14:13:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=953, Unknown=0, NotChecked=0, Total=1482 [2022-11-21 14:13:15,617 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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) [2022-11-21 14:13:22,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:24,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:26,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:28,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:31,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:34,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:13:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:13:39,429 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-21 14:13:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 14:13:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 14:13:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:13:39,431 INFO L225 Difference]: With dead ends: 52 [2022-11-21 14:13:39,431 INFO L226 Difference]: Without dead ends: 50 [2022-11-21 14:13:39,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 465.4s TimeCoverageRelationStatistics Valid=803, Invalid=1549, Unknown=0, NotChecked=0, Total=2352 [2022-11-21 14:13:39,433 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-11-21 14:13:39,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 29 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2022-11-21 14:13:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-21 14:13:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-11-21 14:13:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 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) [2022-11-21 14:13:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-11-21 14:13:39,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 26 [2022-11-21 14:13:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:13:39,457 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-11-21 14:13:39,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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) [2022-11-21 14:13:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-11-21 14:13:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 14:13:39,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:13:39,460 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2022-11-21 14:13:39,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:13:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:13:39,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:13:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:13:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 969805001, now seen corresponding path program 4 times [2022-11-21 14:13:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:13:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662877330] [2022-11-21 14:13:39,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 14:13:39,666 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 [2022-11-21 14:13:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:13:39,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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) [2022-11-21 14:13:39,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 (6)] Waiting until timeout for monitored process [2022-11-21 14:13:39,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 14:13:39,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 14:13:39,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 14:13:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 14:13:40,149 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 14:13:40,150 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 14:13:40,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 14:13:40,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 (6)] Forceful destruction successful, exit code 0 [2022-11-21 14:13:40,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/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 [2022-11-21 14:13:40,392 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2022-11-21 14:13:40,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 14:13:40,461 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,462 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,462 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,462 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,462 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,463 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,463 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,463 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,463 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,464 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,464 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,464 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,464 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,464 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,465 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 02:13:40 BoogieIcfgContainer [2022-11-21 14:13:40,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 14:13:40,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 14:13:40,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 14:13:40,495 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 14:13:40,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:03:37" (3/4) ... [2022-11-21 14:13:40,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 14:13:40,525 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,526 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,526 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,526 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,526 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,527 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,527 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,527 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,527 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,527 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,528 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,528 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,528 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,528 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,528 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-21 14:13:40,622 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 14:13:40,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 14:13:40,623 INFO L158 Benchmark]: Toolchain (without parser) took 603960.89ms. Allocated memory was 77.6MB in the beginning and 182.5MB in the end (delta: 104.9MB). Free memory was 56.0MB in the beginning and 69.2MB in the end (delta: -13.3MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2022-11-21 14:13:40,624 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 77.6MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:13:40,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.81ms. Allocated memory is still 77.6MB. Free memory was 55.6MB in the beginning and 45.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:13:40,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.09ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:13:40,625 INFO L158 Benchmark]: Boogie Preprocessor took 52.45ms. Allocated memory is still 77.6MB. Free memory was 43.2MB in the beginning and 42.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 14:13:40,625 INFO L158 Benchmark]: RCFGBuilder took 457.46ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 57.2MB in the end (delta: -15.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-11-21 14:13:40,626 INFO L158 Benchmark]: TraceAbstraction took 602946.92ms. Allocated memory was 77.6MB in the beginning and 182.5MB in the end (delta: 104.9MB). Free memory was 56.5MB in the beginning and 80.8MB in the end (delta: -24.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2022-11-21 14:13:40,626 INFO L158 Benchmark]: Witness Printer took 127.95ms. Allocated memory is still 182.5MB. Free memory was 80.8MB in the beginning and 69.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 14:13:40,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 77.6MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.81ms. Allocated memory is still 77.6MB. Free memory was 55.6MB in the beginning and 45.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.09ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.45ms. Allocated memory is still 77.6MB. Free memory was 43.2MB in the beginning and 42.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.46ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 57.2MB in the end (delta: -15.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 602946.92ms. Allocated memory was 77.6MB in the beginning and 182.5MB in the end (delta: 104.9MB). Free memory was 56.5MB in the beginning and 80.8MB in the end (delta: -24.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Witness Printer took 127.95ms. Allocated memory is still 182.5MB. Free memory was 80.8MB in the beginning and 69.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L26] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L28] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L29] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L31] const SORT_4 var_5 = 1; [L32] const SORT_4 var_8 = 15; [L33] const SORT_1 var_12 = 1; [L35] SORT_1 input_2; [L36] SORT_1 input_3; [L38] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L40] SORT_4 init_7_arg_1 = var_5; [L41] state_6 = init_7_arg_1 VAL [init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=1, var_12=1, var_5=1, var_8=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=16, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=2, state_6=2, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=2, var_17_arg_0=1, var_17_arg_1=1, var_18=0, var_18_arg_0=1, var_18_arg_1=15, var_19=2, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=2, var_20=2, var_20_arg_0=1, var_20_arg_1=2, var_20_arg_2=1, var_5=1, var_8=15, var_9=1, var_9_arg_0=1, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=17, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=3, state_6=3, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=3, var_17_arg_0=2, var_17_arg_1=1, var_18=0, var_18_arg_0=2, var_18_arg_1=15, var_19=3, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=3, var_20=3, var_20_arg_0=1, var_20_arg_1=3, var_20_arg_2=2, var_5=1, var_8=15, var_9=1, var_9_arg_0=2, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=18, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=4, state_6=4, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=4, var_17_arg_0=3, var_17_arg_1=1, var_18=0, var_18_arg_0=3, var_18_arg_1=15, var_19=4, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=4, var_20=4, var_20_arg_0=1, var_20_arg_1=4, var_20_arg_2=3, var_5=1, var_8=15, var_9=1, var_9_arg_0=3, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=19, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=5, state_6=5, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=5, var_17_arg_0=4, var_17_arg_1=1, var_18=0, var_18_arg_0=4, var_18_arg_1=15, var_19=5, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=5, var_20=5, var_20_arg_0=1, var_20_arg_1=5, var_20_arg_2=4, var_5=1, var_8=15, var_9=1, var_9_arg_0=4, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=20, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=6, state_6=6, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=6, var_17_arg_0=5, var_17_arg_1=1, var_18=0, var_18_arg_0=5, var_18_arg_1=15, var_19=6, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=6, var_20=6, var_20_arg_0=1, var_20_arg_1=6, var_20_arg_2=5, var_5=1, var_8=15, var_9=1, var_9_arg_0=5, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=21, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=7, state_6=7, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=7, var_17_arg_0=6, var_17_arg_1=1, var_18=0, var_18_arg_0=6, var_18_arg_1=15, var_19=7, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=7, var_20=7, var_20_arg_0=1, var_20_arg_1=7, var_20_arg_2=6, var_5=1, var_8=15, var_9=1, var_9_arg_0=6, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=22, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=8, state_6=8, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=8, var_17_arg_0=7, var_17_arg_1=1, var_18=0, var_18_arg_0=7, var_18_arg_1=15, var_19=8, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=8, var_20=8, var_20_arg_0=1, var_20_arg_1=8, var_20_arg_2=7, var_5=1, var_8=15, var_9=1, var_9_arg_0=7, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=23, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=9, state_6=9, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=9, var_17_arg_0=8, var_17_arg_1=1, var_18=0, var_18_arg_0=8, var_18_arg_1=15, var_19=9, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=9, var_20=9, var_20_arg_0=1, var_20_arg_1=9, var_20_arg_2=8, var_5=1, var_8=15, var_9=1, var_9_arg_0=8, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=24, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=10, state_6=10, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=10, var_17_arg_0=9, var_17_arg_1=1, var_18=0, var_18_arg_0=9, var_18_arg_1=15, var_19=10, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=10, var_20=10, var_20_arg_0=1, var_20_arg_1=10, var_20_arg_2=9, var_5=1, var_8=15, var_9=1, var_9_arg_0=9, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=25, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=11, state_6=11, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=11, var_17_arg_0=10, var_17_arg_1=1, var_18=0, var_18_arg_0=10, var_18_arg_1=15, var_19=11, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=11, var_20=11, var_20_arg_0=1, var_20_arg_1=11, var_20_arg_2=10, var_5=1, var_8=15, var_9=1, var_9_arg_0=10, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=26, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=12, state_6=12, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=12, var_17_arg_0=11, var_17_arg_1=1, var_18=0, var_18_arg_0=11, var_18_arg_1=15, var_19=12, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=12, var_20=12, var_20_arg_0=1, var_20_arg_1=12, var_20_arg_2=11, var_5=1, var_8=15, var_9=1, var_9_arg_0=11, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=27, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=13, state_6=13, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=13, var_17_arg_0=12, var_17_arg_1=1, var_18=0, var_18_arg_0=12, var_18_arg_1=15, var_19=13, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=13, var_20=13, var_20_arg_0=1, var_20_arg_1=13, var_20_arg_2=12, var_5=1, var_8=15, var_9=1, var_9_arg_0=12, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=28, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=14, state_6=14, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=14, var_17_arg_0=13, var_17_arg_1=1, var_18=0, var_18_arg_0=13, var_18_arg_1=15, var_19=14, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=14, var_20=14, var_20_arg_0=1, var_20_arg_1=14, var_20_arg_2=13, var_5=1, var_8=15, var_9=1, var_9_arg_0=13, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_15_arg_0)) [L61] SORT_4 var_18_arg_0 = state_6; [L62] SORT_4 var_18_arg_1 = var_8; [L63] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L64] SORT_4 var_17_arg_0 = state_6; [L65] SORT_4 var_17_arg_1 = var_5; [L66] SORT_4 var_17 = var_17_arg_0 + var_17_arg_1; [L67] SORT_1 var_19_arg_0 = var_18; [L68] SORT_4 var_19_arg_1 = var_5; [L69] SORT_4 var_19_arg_2 = var_17; [L70] SORT_4 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L71] SORT_1 var_20_arg_0 = input_3; [L72] SORT_4 var_20_arg_1 = var_19; [L73] SORT_4 var_20_arg_2 = state_6; [L74] SORT_4 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; [L75] var_20 = var_20 & mask_SORT_4 [L76] SORT_4 next_21_arg_1 = var_20; [L78] state_6 = next_21_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=1, input_2=29, input_3=1, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_21_arg_1=15, state_6=15, var_12=1, var_13=254, var_13_arg_0=1, var_14=0, var_14_arg_0=1, var_14_arg_1=254, var_17=15, var_17_arg_0=14, var_17_arg_1=1, var_18=0, var_18_arg_0=14, var_18_arg_1=15, var_19=15, var_19_arg_0=0, var_19_arg_1=1, var_19_arg_2=15, var_20=15, var_20_arg_0=1, var_20_arg_1=15, var_20_arg_2=14, var_5=1, var_8=15, var_9=1, var_9_arg_0=14, var_9_arg_1=15] [L44] input_2 = __VERIFIER_nondet_uchar() [L45] input_3 = __VERIFIER_nondet_uchar() [L46] input_3 = input_3 & mask_SORT_1 [L49] SORT_4 var_9_arg_0 = state_6; [L50] SORT_4 var_9_arg_1 = var_8; [L51] SORT_1 var_9 = var_9_arg_0 != var_9_arg_1; [L52] SORT_1 var_13_arg_0 = var_9; [L53] SORT_1 var_13 = ~var_13_arg_0; [L54] SORT_1 var_14_arg_0 = var_12; [L55] SORT_1 var_14_arg_1 = var_13; [L56] SORT_1 var_14 = var_14_arg_0 & var_14_arg_1; [L57] var_14 = var_14 & mask_SORT_1 [L58] SORT_1 bad_15_arg_0 = var_14; [L59] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L20] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L20] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 602.7s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 174 IncrementalHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 17 mSDtfsCounter, 174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 564.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 574.1s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 37 QuantifiedInterpolants, 25550 SizeOfPredicates, 319 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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 proved your program to be incorrect! [2022-11-21 14:13:40,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3d4411-4539-472d-b66f-3bdc0c114105/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE