./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro --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 01e407ff37f0e05cc0af0c9add6c9f6be76650fc51d4c59f5df1e4bebb9e67d5 --- 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-8393723 [2022-11-18 20:29:41,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:29:41,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:29:41,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:29:41,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:29:42,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:29:42,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:29:42,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:29:42,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:29:42,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:29:42,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:29:42,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:29:42,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:29:42,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:29:42,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:29:42,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:29:42,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:29:42,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:29:42,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:29:42,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:29:42,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:29:42,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:29:42,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:29:42,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:29:42,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:29:42,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:29:42,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:29:42,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:29:42,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:29:42,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:29:42,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:29:42,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:29:42,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:29:42,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:29:42,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:29:42,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:29:42,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:29:42,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:29:42,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:29:42,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:29:42,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:29:42,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:29:42,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:29:42,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:29:42,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:29:42,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:29:42,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:29:42,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:29:42,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:29:42,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:29:42,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:29:42,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:29:42,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:29:42,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:29:42,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:29:42,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:29:42,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:29:42,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:29:42,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:29:42,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:29:42,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:29:42,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:29:42,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:29:42,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:42,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:29:42,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:29:42,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:29:42,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:29:42,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:29:42,116 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:29:42,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:29:42,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:29:42,117 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_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro 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 -> 01e407ff37f0e05cc0af0c9add6c9f6be76650fc51d4c59f5df1e4bebb9e67d5 [2022-11-18 20:29:42,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:29:42,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:29:42,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:29:42,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:29:42,376 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:29:42,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:42,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/7d6c8ceb3/ff5ab14d7dce4e7ca7aeb71c62583397/FLAG8415886d6 [2022-11-18 20:29:42,998 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:29:42,998 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:43,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/7d6c8ceb3/ff5ab14d7dce4e7ca7aeb71c62583397/FLAG8415886d6 [2022-11-18 20:29:43,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/7d6c8ceb3/ff5ab14d7dce4e7ca7aeb71c62583397 [2022-11-18 20:29:43,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:29:43,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:29:43,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:43,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:29:43,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:29:43,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1213f7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43, skipping insertion in model container [2022-11-18 20:29:43,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:29:43,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:29:43,567 WARN L234 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_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-18 20:29:43,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:43,616 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:29:43,625 WARN L234 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_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-18 20:29:43,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:43,647 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:29:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43 WrapperNode [2022-11-18 20:29:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:43,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:43,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:29:43,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:29:43,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,678 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2022-11-18 20:29:43,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:43,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:29:43,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:29:43,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:29:43,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,698 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:29:43,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:29:43,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:29:43,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:29:43,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (1/1) ... [2022-11-18 20:29:43,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:43,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:29:43,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:29:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:29:43,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:29:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:29:43,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:29:43,846 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:29:43,848 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:29:44,003 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:29:44,010 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:29:44,010 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:29:44,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:44 BoogieIcfgContainer [2022-11-18 20:29:44,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:29:44,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:29:44,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:29:44,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:29:44,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:29:43" (1/3) ... [2022-11-18 20:29:44,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268e8e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:44, skipping insertion in model container [2022-11-18 20:29:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:43" (2/3) ... [2022-11-18 20:29:44,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268e8e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:44, skipping insertion in model container [2022-11-18 20:29:44,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:44" (3/3) ... [2022-11-18 20:29:44,025 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:44,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:29:44,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:29:44,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:29:44,101 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;@5a729481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:29:44,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:29:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:29:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:29:44,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:44,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:44,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1811078494, now seen corresponding path program 1 times [2022-11-18 20:29:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:44,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695413852] [2022-11-18 20:29:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:44,611 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-18 20:29:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:44,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695413852] [2022-11-18 20:29:44,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695413852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:44,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:29:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995172657] [2022-11-18 20:29:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:44,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:29:44,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:29:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:29:44,648 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:29:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:44,776 INFO L93 Difference]: Finished difference Result 56 states and 85 transitions. [2022-11-18 20:29:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:29:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 20:29:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:44,786 INFO L225 Difference]: With dead ends: 56 [2022-11-18 20:29:44,787 INFO L226 Difference]: Without dead ends: 35 [2022-11-18 20:29:44,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:29:44,793 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:44,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:29:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-18 20:29:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-11-18 20:29:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:29:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-18 20:29:44,834 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 7 [2022-11-18 20:29:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:44,834 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-18 20:29:44,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:29:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-18 20:29:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:29:44,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:44,836 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:44,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:29:44,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 274923725, now seen corresponding path program 1 times [2022-11-18 20:29:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556422491] [2022-11-18 20:29:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:29:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:29:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556422491] [2022-11-18 20:29:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556422491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:45,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:29:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627533049] [2022-11-18 20:29:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:45,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:29:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:29:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:29:45,041 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:45,120 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-18 20:29:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:29:45,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-18 20:29:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:45,123 INFO L225 Difference]: With dead ends: 44 [2022-11-18 20:29:45,124 INFO L226 Difference]: Without dead ends: 42 [2022-11-18 20:29:45,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:29:45,126 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:45,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:29:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-18 20:29:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-18 20:29:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:29:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-18 20:29:45,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2022-11-18 20:29:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:45,146 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-18 20:29:45,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-18 20:29:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:29:45,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:45,148 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:45,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:29:45,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1560329275, now seen corresponding path program 1 times [2022-11-18 20:29:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:45,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248835261] [2022-11-18 20:29:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:29:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:29:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:45,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248835261] [2022-11-18 20:29:45,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248835261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:45,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:29:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118164330] [2022-11-18 20:29:45,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:29:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:45,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:29:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:29:45,384 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:45,441 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-11-18 20:29:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:29:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-18 20:29:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:45,442 INFO L225 Difference]: With dead ends: 69 [2022-11-18 20:29:45,442 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 20:29:45,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:29:45,445 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:45,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 64 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:29:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 20:29:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2022-11-18 20:29:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:29:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-18 20:29:45,454 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2022-11-18 20:29:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:45,455 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-18 20:29:45,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-18 20:29:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:29:45,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:45,456 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:29:45,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 477440078, now seen corresponding path program 1 times [2022-11-18 20:29:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995142276] [2022-11-18 20:29:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:45,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:29:45,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446007011] [2022-11-18 20:29:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:29:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:45,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:29:45,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:29:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:45,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 20:29:45,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:29:45,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:29:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:45,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995142276] [2022-11-18 20:29:45,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:29:45,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446007011] [2022-11-18 20:29:45,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446007011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:45,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:29:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997567304] [2022-11-18 20:29:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:45,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:29:45,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:45,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:29:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:29:45,915 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:29:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:46,117 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-11-18 20:29:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:29:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-18 20:29:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:46,123 INFO L225 Difference]: With dead ends: 75 [2022-11-18 20:29:46,124 INFO L226 Difference]: Without dead ends: 52 [2022-11-18 20:29:46,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:29:46,133 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:46,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:29:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-18 20:29:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2022-11-18 20:29:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:29:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-18 20:29:46,152 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 24 [2022-11-18 20:29:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:46,153 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-18 20:29:46,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:29:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-18 20:29:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:29:46,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:46,156 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:46,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:29:46,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:29:46,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1686008792, now seen corresponding path program 1 times [2022-11-18 20:29:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:46,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589573890] [2022-11-18 20:29:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:46,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:29:46,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923407268] [2022-11-18 20:29:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:29:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:46,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:29:46,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:29:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:46,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-18 20:29:46,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:29:46,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:29:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:29:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589573890] [2022-11-18 20:29:46,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 20:29:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923407268] [2022-11-18 20:29:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923407268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:46,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:46,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:29:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862516888] [2022-11-18 20:29:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:46,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:29:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:29:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:29:46,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:29:46,660 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:29:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:46,758 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-11-18 20:29:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:29:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-18 20:29:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:46,762 INFO L225 Difference]: With dead ends: 62 [2022-11-18 20:29:46,762 INFO L226 Difference]: Without dead ends: 39 [2022-11-18 20:29:46,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:29:46,764 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:46,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:29:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-18 20:29:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-11-18 20:29:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:29:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-18 20:29:46,786 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 25 [2022-11-18 20:29:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:46,787 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-18 20:29:46,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:29:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-18 20:29:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:29:46,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:46,789 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:46,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:46,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:29:46,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 88998570, now seen corresponding path program 1 times [2022-11-18 20:29:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:29:46,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628166874] [2022-11-18 20:29:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:29:47,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 20:29:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218599606] [2022-11-18 20:29:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:29:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:47,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:29:47,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:29:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:29:47,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:29:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:29:47,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:29:47,179 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:29:47,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:29:47,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:47,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:29:47,386 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 20:29:47,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:29:47,413 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:29:47,413 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:29:47,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:29:47 BoogieIcfgContainer [2022-11-18 20:29:47,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:29:47,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:29:47,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:29:47,436 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:29:47,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:44" (3/4) ... [2022-11-18 20:29:47,441 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:29:47,441 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:29:47,442 INFO L158 Benchmark]: Toolchain (without parser) took 4083.88ms. Allocated memory is still 134.2MB. Free memory was 101.6MB in the beginning and 61.8MB in the end (delta: 39.8MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-11-18 20:29:47,442 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:29:47,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 110.1MB in the end (delta: -8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:29:47,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.17ms. Allocated memory is still 134.2MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:29:47,443 INFO L158 Benchmark]: Boogie Preprocessor took 21.47ms. Allocated memory is still 134.2MB. Free memory was 108.6MB in the beginning and 107.3MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:29:47,444 INFO L158 Benchmark]: RCFGBuilder took 311.90ms. Allocated memory is still 134.2MB. Free memory was 107.3MB in the beginning and 96.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:29:47,444 INFO L158 Benchmark]: TraceAbstraction took 3420.71ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 61.8MB in the end (delta: 32.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-18 20:29:47,444 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 134.2MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:29:47,447 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.14ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 134.2MB. Free memory was 101.3MB in the beginning and 110.1MB in the end (delta: -8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.17ms. Allocated memory is still 134.2MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.47ms. Allocated memory is still 134.2MB. Free memory was 108.6MB in the beginning and 107.3MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 311.90ms. Allocated memory is still 134.2MB. Free memory was 107.3MB in the beginning and 96.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3420.71ms. Allocated memory is still 134.2MB. Free memory was 94.7MB in the beginning and 61.8MB in the end (delta: 32.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 134.2MB. Free memory is still 61.8MB. 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: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 75. Possible FailurePath: [L33] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L34] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L36] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L37] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L39] const SORT_1 var_2 = 1; [L40] const SORT_1 var_11 = mask_SORT_1; [L41] const SORT_1 var_16 = 3; [L44] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 init_5_arg_1 = var_2; [L48] state_3 = init_5_arg_1 [L49] SORT_1 init_6_arg_1 = var_2; [L50] state_4 = init_6_arg_1 VAL [init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L68] var_18 = var_18 & mask_SORT_12 VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1] [L75] var_7 = var_7 & mask_SORT_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=15, var_7_arg_0=1, var_7_arg_1=1] [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=15, state_3=1, state_4=15, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=15, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=15, state_3=1, state_4=15, var_11=15, var_13=1, var_13_arg_0=15, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=15, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L28] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L28] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 396 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 115 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 336 SizeOfPredicates, 17 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 24/24 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-18 20:29:47,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro --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 01e407ff37f0e05cc0af0c9add6c9f6be76650fc51d4c59f5df1e4bebb9e67d5 --- 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-8393723 [2022-11-18 20:29:49,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:29:49,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:29:49,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:29:49,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:29:49,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:29:49,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:29:49,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:29:49,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:29:49,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:29:49,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:29:49,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:29:49,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:29:49,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:29:49,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:29:49,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:29:49,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:29:49,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:29:49,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:29:49,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:29:49,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:29:49,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:29:49,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:29:49,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:29:49,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:29:49,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:29:49,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:29:49,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:29:49,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:29:49,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:29:49,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:29:49,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:29:49,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:29:49,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:29:49,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:29:49,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:29:49,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:29:49,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:29:49,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:29:49,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:29:49,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:29:49,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:29:49,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:29:49,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:29:49,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:29:49,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:29:49,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:29:49,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:29:49,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:29:49,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:29:49,837 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:29:49,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:29:49,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:29:49,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:29:49,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:29:49,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:29:49,840 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:29:49,840 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:29:49,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:29:49,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:29:49,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:29:49,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:29:49,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:29:49,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:29:49,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:29:49,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:49,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:29:49,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:29:49,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:29:49,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:29:49,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:29:49,843 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:29:49,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:29:49,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:29:49,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:29:49,844 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_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro 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 -> 01e407ff37f0e05cc0af0c9add6c9f6be76650fc51d4c59f5df1e4bebb9e67d5 [2022-11-18 20:29:50,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:29:50,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:29:50,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:29:50,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:29:50,265 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:29:50,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:50,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/c69fbc6b9/472a802eaefb4dd4b0d27ed795c45a11/FLAGac9494a2a [2022-11-18 20:29:50,949 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:29:50,950 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:50,958 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/c69fbc6b9/472a802eaefb4dd4b0d27ed795c45a11/FLAGac9494a2a [2022-11-18 20:29:51,278 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/data/c69fbc6b9/472a802eaefb4dd4b0d27ed795c45a11 [2022-11-18 20:29:51,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:29:51,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:29:51,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:51,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:29:51,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:29:51,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318c6cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51, skipping insertion in model container [2022-11-18 20:29:51,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:29:51,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:29:51,464 WARN L234 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_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-18 20:29:51,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:51,504 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:29:51,515 WARN L234 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_b687be08-b8d8-42f1-901f-a18550803e1a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.factorial4even.c[1292,1305] [2022-11-18 20:29:51,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:29:51,586 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:29:51,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51 WrapperNode [2022-11-18 20:29:51,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:29:51,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:51,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:29:51,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:29:51,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,621 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2022-11-18 20:29:51,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:29:51,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:29:51,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:29:51,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:29:51,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:29:51,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:29:51,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:29:51,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:29:51,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (1/1) ... [2022-11-18 20:29:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:29:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:29:51,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:29:51,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:29:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:29:51,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:29:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 20:29:51,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 20:29:51,814 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:29:51,817 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:29:52,062 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:29:52,070 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:29:52,070 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 20:29:52,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:52 BoogieIcfgContainer [2022-11-18 20:29:52,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:29:52,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:29:52,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:29:52,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:29:52,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:29:51" (1/3) ... [2022-11-18 20:29:52,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46351316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:52, skipping insertion in model container [2022-11-18 20:29:52,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:29:51" (2/3) ... [2022-11-18 20:29:52,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46351316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:29:52, skipping insertion in model container [2022-11-18 20:29:52,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:52" (3/3) ... [2022-11-18 20:29:52,081 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2022-11-18 20:29:52,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:29:52,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:29:52,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:29:52,171 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;@6c449d68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:29:52,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:29:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-18 20:29:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:29:52,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:52,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:52,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-11-18 20:29:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:52,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840820864] [2022-11-18 20:29:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:52,207 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-18 20:29:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:52,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:52,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:52,285 WARN L261 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:29:52,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:52,466 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-18 20:29:52,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:29:52,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840820864] [2022-11-18 20:29:52,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840820864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:52,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:52,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:29:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840233113] [2022-11-18 20:29:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:52,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:29:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:29:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:29:52,516 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:29:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:52,679 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-11-18 20:29:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:29:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 20:29:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:52,692 INFO L225 Difference]: With dead ends: 38 [2022-11-18 20:29:52,692 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 20:29:52,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:29:52,701 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:52,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:29:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 20:29:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-11-18 20:29:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:29:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-18 20:29:52,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-11-18 20:29:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-18 20:29:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:29:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-18 20:29:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:29:52,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:52,773 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:52,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:52,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:52,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 679252028, now seen corresponding path program 1 times [2022-11-18 20:29:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:52,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102229586] [2022-11-18 20:29:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:52,991 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-18 20:29:52,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:52,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:53,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:29:53,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:29:53,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:29:53,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102229586] [2022-11-18 20:29:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102229586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:29:53,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:29:53,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:29:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295057545] [2022-11-18 20:29:53,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:29:53,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:29:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:29:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:29:53,317 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:53,416 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-18 20:29:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:29:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-18 20:29:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:53,418 INFO L225 Difference]: With dead ends: 31 [2022-11-18 20:29:53,418 INFO L226 Difference]: Without dead ends: 29 [2022-11-18 20:29:53,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:29:53,421 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:53,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 66 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:29:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-18 20:29:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-11-18 20:29:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 20:29:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-18 20:29:53,433 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2022-11-18 20:29:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:53,434 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-18 20:29:53,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:29:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-18 20:29:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:29:53,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:53,436 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:53,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1082860028, now seen corresponding path program 1 times [2022-11-18 20:29:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089711975] [2022-11-18 20:29:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:29:53,650 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-18 20:29:53,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:53,652 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:29:53,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:29:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:29:53,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:29:54,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:54,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089711975] [2022-11-18 20:29:54,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089711975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:29:54,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:29:54,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-18 20:29:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251860197] [2022-11-18 20:29:54,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:29:54,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:29:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:54,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:29:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:29:54,189 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:29:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:54,538 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-18 20:29:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:29:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2022-11-18 20:29:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:54,542 INFO L225 Difference]: With dead ends: 48 [2022-11-18 20:29:54,544 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 20:29:54,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:29:54,547 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:54,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 76 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:29:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 20:29:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-11-18 20:29:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:29:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-11-18 20:29:54,584 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2022-11-18 20:29:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:54,585 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-11-18 20:29:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:29:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-11-18 20:29:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:29:54,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:54,587 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:29:54,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:54,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2028547162, now seen corresponding path program 2 times [2022-11-18 20:29:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317292534] [2022-11-18 20:29:54,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:29:54,802 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-18 20:29:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:54,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:54,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:54,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:29:54,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:54,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:29:54,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:29:55,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:55,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:55,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317292534] [2022-11-18 20:29:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317292534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:55,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [657044650] [2022-11-18 20:29:55,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:29:55,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:29:55,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:29:55,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:29:55,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-18 20:29:55,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:29:55,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:55,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:29:55,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 20:29:55,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:55,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [657044650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:55,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:29:55,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-18 20:29:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782937871] [2022-11-18 20:29:55,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:29:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:29:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:29:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:29:55,650 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:29:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:55,826 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-11-18 20:29:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:29:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-18 20:29:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:55,833 INFO L225 Difference]: With dead ends: 48 [2022-11-18 20:29:55,834 INFO L226 Difference]: Without dead ends: 46 [2022-11-18 20:29:55,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:29:55,838 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:55,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 76 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:29:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-18 20:29:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-18 20:29:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:29:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-11-18 20:29:55,872 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2022-11-18 20:29:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:55,873 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-11-18 20:29:55,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:29:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-11-18 20:29:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:29:55,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:55,880 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-18 20:29:55,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-11-18 20:29:56,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:56,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:56,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash -690507524, now seen corresponding path program 3 times [2022-11-18 20:29:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903259926] [2022-11-18 20:29:56,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:29:56,285 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-18 20:29:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:56,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:56,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (7)] Waiting until timeout for monitored process [2022-11-18 20:29:56,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:29:56,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:56,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:29:56,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-18 20:29:56,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:56,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:56,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903259926] [2022-11-18 20:29:56,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903259926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:56,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1169849799] [2022-11-18 20:29:56,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:29:56,739 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:29:56,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:29:56,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:29:56,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-18 20:29:56,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:29:56,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:29:56,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-18 20:29:57,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1169849799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:57,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:29:57,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-18 20:29:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395363578] [2022-11-18 20:29:57,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:29:57,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:29:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:57,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:29:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:29:57,091 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 20:29:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:57,174 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-18 20:29:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:29:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-11-18 20:29:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:57,176 INFO L225 Difference]: With dead ends: 52 [2022-11-18 20:29:57,177 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 20:29:57,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:29:57,178 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:57,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 47 Unchecked, 0.0s Time] [2022-11-18 20:29:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 20:29:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-18 20:29:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:29:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-18 20:29:57,193 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 39 [2022-11-18 20:29:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:57,194 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-18 20:29:57,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 20:29:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-18 20:29:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:29:57,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:57,201 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-18 20:29:57,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:57,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:57,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:57,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1442399130, now seen corresponding path program 4 times [2022-11-18 20:29:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:57,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180025301] [2022-11-18 20:29:57,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:29:57,605 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-18 20:29:57,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:57,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:57,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (9)] Waiting until timeout for monitored process [2022-11-18 20:29:57,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:29:57,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:57,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:29:57,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-18 20:29:58,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:58,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:29:58,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180025301] [2022-11-18 20:29:58,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180025301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:58,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561359112] [2022-11-18 20:29:58,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:29:58,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:29:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:29:58,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:29:58,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-18 20:29:58,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:29:58,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:29:58,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-18 20:29:58,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:29:58,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1561359112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:29:58,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:29:58,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-18 20:29:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231742589] [2022-11-18 20:29:58,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:29:58,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:29:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:29:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:29:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:29:58,733 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:29:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:29:58,816 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-18 20:29:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:29:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2022-11-18 20:29:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:29:58,817 INFO L225 Difference]: With dead ends: 56 [2022-11-18 20:29:58,818 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 20:29:58,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:29:58,819 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:29:58,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 45 Unchecked, 0.0s Time] [2022-11-18 20:29:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 20:29:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-18 20:29:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-18 20:29:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-18 20:29:58,832 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2022-11-18 20:29:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:29:58,833 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-18 20:29:58,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:29:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-18 20:29:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:29:58,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:29:58,835 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-11-18 20:29:58,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:59,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:29:59,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:59,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:29:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:29:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -962754338, now seen corresponding path program 5 times [2022-11-18 20:29:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:29:59,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369301239] [2022-11-18 20:29:59,238 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:29:59,238 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-18 20:29:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:29:59,239 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:29:59,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (11)] Waiting until timeout for monitored process [2022-11-18 20:29:59,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-18 20:29:59,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:29:59,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:29:59,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:29:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 20:29:59,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 20:30:00,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:30:00,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369301239] [2022-11-18 20:30:00,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369301239] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:00,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:30:00,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-18 20:30:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017337964] [2022-11-18 20:30:00,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:00,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:30:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:30:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:30:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:30:00,152 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-18 20:30:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:00,994 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2022-11-18 20:30:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:30:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 59 [2022-11-18 20:30:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:00,997 INFO L225 Difference]: With dead ends: 89 [2022-11-18 20:30:00,997 INFO L226 Difference]: Without dead ends: 87 [2022-11-18 20:30:00,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-11-18 20:30:00,998 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:00,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 159 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:30:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-18 20:30:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-11-18 20:30:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-18 20:30:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-18 20:30:01,037 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 59 [2022-11-18 20:30:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:01,038 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-18 20:30:01,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-11-18 20:30:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-18 20:30:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 20:30:01,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:01,047 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2022-11-18 20:30:01,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:30:01,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1753079548, now seen corresponding path program 6 times [2022-11-18 20:30:01,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:30:01,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347697932] [2022-11-18 20:30:01,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:30:01,260 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-18 20:30:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:30:01,261 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:30:01,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (12)] Waiting until timeout for monitored process [2022-11-18 20:30:01,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-11-18 20:30:01,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:30:01,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-18 20:30:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-18 20:30:02,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-11-18 20:30:04,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:30:04,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347697932] [2022-11-18 20:30:04,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347697932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:04,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:30:04,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-11-18 20:30:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444940754] [2022-11-18 20:30:04,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:04,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:30:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:30:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:30:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-11-18 20:30:04,003 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-18 20:30:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:07,677 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2022-11-18 20:30:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:30:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 124 [2022-11-18 20:30:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:07,679 INFO L225 Difference]: With dead ends: 148 [2022-11-18 20:30:07,680 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:30:07,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=523, Invalid=1927, Unknown=0, NotChecked=0, Total=2450 [2022-11-18 20:30:07,681 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:07,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 353 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-18 20:30:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:30:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2022-11-18 20:30:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.010989010989011) internal successors, (92), 92 states have internal predecessors, (92), 41 states have call successors, (41), 9 states have call predecessors, (41), 9 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-18 20:30:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-11-18 20:30:07,735 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 124 [2022-11-18 20:30:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:07,736 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-11-18 20:30:07,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2022-11-18 20:30:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-11-18 20:30:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-18 20:30:07,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:07,738 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1] [2022-11-18 20:30:07,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:30:07,955 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1810513054, now seen corresponding path program 7 times [2022-11-18 20:30:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:30:07,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183266774] [2022-11-18 20:30:07,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:30:07,956 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-18 20:30:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:30:07,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:30:07,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (13)] Waiting until timeout for monitored process [2022-11-18 20:30:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:30:08,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:30:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:30:08,391 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 20:30:08,392 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:30:08,393 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:30:08,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:08,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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-18 20:30:08,612 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2022-11-18 20:30:08,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,711 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,712 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,713 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,713 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,713 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:30:08 BoogieIcfgContainer [2022-11-18 20:30:08,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:30:08,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:30:08,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:30:08,779 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:30:08,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:29:52" (3/4) ... [2022-11-18 20:30:08,782 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,820 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,821 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,822 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,822 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-18 20:30:08,932 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:30:08,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:30:08,933 INFO L158 Benchmark]: Toolchain (without parser) took 17649.90ms. Allocated memory was 62.9MB in the beginning and 172.0MB in the end (delta: 109.1MB). Free memory was 43.3MB in the beginning and 135.5MB in the end (delta: -92.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-11-18 20:30:08,933 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:30:08,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.68ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 47.4MB in the end (delta: -4.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 20:30:08,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 62.9MB. Free memory was 47.2MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:30:08,934 INFO L158 Benchmark]: Boogie Preprocessor took 25.63ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 44.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:30:08,935 INFO L158 Benchmark]: RCFGBuilder took 423.67ms. Allocated memory is still 62.9MB. Free memory was 44.5MB in the beginning and 34.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:30:08,935 INFO L158 Benchmark]: TraceAbstraction took 16704.09ms. Allocated memory was 62.9MB in the beginning and 172.0MB in the end (delta: 109.1MB). Free memory was 33.4MB in the beginning and 150.1MB in the end (delta: -116.7MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2022-11-18 20:30:08,935 INFO L158 Benchmark]: Witness Printer took 153.26ms. Allocated memory is still 172.0MB. Free memory was 150.1MB in the beginning and 135.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 20:30:08,937 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.35ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.68ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 47.4MB in the end (delta: -4.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 62.9MB. Free memory was 47.2MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.63ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 44.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.67ms. Allocated memory is still 62.9MB. Free memory was 44.5MB in the beginning and 34.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16704.09ms. Allocated memory was 62.9MB in the beginning and 172.0MB in the end (delta: 109.1MB). Free memory was 33.4MB in the beginning and 150.1MB in the end (delta: -116.7MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Witness Printer took 153.26ms. Allocated memory is still 172.0MB. Free memory was 150.1MB in the beginning and 135.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L34] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L36] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L37] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L39] const SORT_1 var_2 = 1; [L40] const SORT_1 var_11 = mask_SORT_1; [L41] const SORT_1 var_16 = 3; [L44] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 init_5_arg_1 = var_2; [L48] state_3 = init_5_arg_1 [L49] SORT_1 init_6_arg_1 = var_2; [L50] state_4 = init_6_arg_1 VAL [init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L59] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L60] SORT_1 var_17_arg_0 = state_4; [L61] SORT_1 var_17_arg_1 = var_16; [L62] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L63] SORT_1 var_15_arg_0 = state_3; [L64] SORT_12 var_15 = var_15_arg_0 >> 0; [L65] SORT_12 var_18_arg_0 = var_17; [L66] SORT_12 var_18_arg_1 = var_15; [L67] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L68] var_18 = var_18 & mask_SORT_12 [L69] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L70] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L28] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L70] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L72] SORT_1 var_7_arg_0 = state_4; [L73] SORT_1 var_7_arg_1 = var_2; [L74] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L75] var_7 = var_7 & mask_SORT_1 [L76] SORT_1 next_9_arg_1 = var_7; [L77] SORT_1 var_8_arg_0 = state_3; [L78] SORT_1 var_8_arg_1 = state_4; [L79] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L80] SORT_1 next_10_arg_1 = var_8; [L82] state_4 = next_9_arg_1 [L83] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=15, state_3=0, state_4=15, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=15, var_7_arg_0=14, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=14] [L55] SORT_1 var_13_arg_0 = state_4; [L56] SORT_1 var_13_arg_1 = var_11; [L57] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L58] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_1=15, mask_SORT_12=1, msb_SORT_1=8, msb_SORT_12=1, next_10_arg_1=0, next_9_arg_1=15, state_3=0, state_4=15, var_11=15, var_13=1, var_13_arg_0=15, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=15, var_7_arg_0=14, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=14] [L59] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L28] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L28] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 812 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1612 IncrementalHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 176 mSDtfsCounter, 1612 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 592 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=8, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 646 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 646 ConstructedInterpolants, 44 QuantifiedInterpolants, 7835 SizeOfPredicates, 222 NumberOfNonLiveVariables, 1306 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1908/2466 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-18 20:30:08,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b687be08-b8d8-42f1-901f-a18550803e1a/bin/uautomizer-TMbwUNV5ro/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE